./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.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.4.ufo.BOUNDED-8.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 b67ecf5848be9c2e67ab202f4088edc38ff4a91991b1583263c2018f06031ba2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:43:40,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:43:40,569 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:43:40,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:43:40,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:43:40,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:43:40,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:43:40,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:43:40,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:43:40,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:43:40,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:43:40,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:43:40,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:43:40,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:43:40,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:43:40,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:43:40,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:40,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:40,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:43:40,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:43:40,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:43:40,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:43:40,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:43:40,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:43:40,593 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 -> b67ecf5848be9c2e67ab202f4088edc38ff4a91991b1583263c2018f06031ba2 [2025-01-09 04:43:40,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:43:40,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:43:40,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:43:40,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:43:40,828 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:43:40,829 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:43:41,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b15f5148/066fa06b48d847fd9a2789ec39b9acfc/FLAGebe0e1625 [2025-01-09 04:43:42,413 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:43:42,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:43:42,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b15f5148/066fa06b48d847fd9a2789ec39b9acfc/FLAGebe0e1625 [2025-01-09 04:43:42,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b15f5148/066fa06b48d847fd9a2789ec39b9acfc [2025-01-09 04:43:42,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:43:42,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:43:42,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:43:42,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:43:42,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:43:42,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:42" (1/1) ... [2025-01-09 04:43:42,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:42, skipping insertion in model container [2025-01-09 04:43:42,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:42" (1/1) ... [2025-01-09 04:43:42,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:43:42,976 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12458,12471] [2025-01-09 04:43:42,998 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19724,19737] [2025-01-09 04:43:43,014 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22076,22089] [2025-01-09 04:43:43,021 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23196,23209] [2025-01-09 04:43:43,042 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26746,26759] [2025-01-09 04:43:43,050 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27869,27882] [2025-01-09 04:43:43,063 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30184,30197] [2025-01-09 04:43:43,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:43:43,394 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:43:43,469 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12458,12471] [2025-01-09 04:43:43,484 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19724,19737] [2025-01-09 04:43:43,487 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22076,22089] [2025-01-09 04:43:43,491 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23196,23209] [2025-01-09 04:43:43,496 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26746,26759] [2025-01-09 04:43:43,498 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27869,27882] [2025-01-09 04:43:43,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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30184,30197] [2025-01-09 04:43:43,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:43:43,700 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:43:43,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43 WrapperNode [2025-01-09 04:43:43,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:43:43,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:43:43,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:43:43,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:43:43,708 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:43:43" (1/1) ... [2025-01-09 04:43:43,749 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:43:43" (1/1) ... [2025-01-09 04:43:43,884 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7677 [2025-01-09 04:43:43,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:43:43,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:43:43,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:43:43,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:43:43,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:43,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:43,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:43,944 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:43:43,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:43,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:43,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:43:44,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:43:44,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:43:44,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:43:44,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (1/1) ... [2025-01-09 04:43:44,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:43:44,136 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:43:44,142 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:43:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:43:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:43:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:43:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:43:44,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:43:44,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:43:47,144 INFO L? ?]: Removed 1280 outVars from TransFormulas that were not future-live. [2025-01-09 04:43:47,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:43:47,167 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:43:47,167 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:43:47,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:47 BoogieIcfgContainer [2025-01-09 04:43:47,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:43:47,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:43:47,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:43:47,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:43:47,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:42" (1/3) ... [2025-01-09 04:43:47,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a435f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:47, skipping insertion in model container [2025-01-09 04:43:47,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:43" (2/3) ... [2025-01-09 04:43:47,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a435f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:47, skipping insertion in model container [2025-01-09 04:43:47,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:47" (3/3) ... [2025-01-09 04:43:47,179 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:43:47,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:43:47,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 1106 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-01-09 04:43:47,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:43:47,292 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;@55f41914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:43:47,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 04:43:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have 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:43:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:43:47,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:47,321 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] [2025-01-09 04:43:47,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1160265217, now seen corresponding path program 1 times [2025-01-09 04:43:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229195373] [2025-01-09 04:43:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:47,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:43:47,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:43:47,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:47,667 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:43:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229195373] [2025-01-09 04:43:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229195373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026919496] [2025-01-09 04:43:47,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:47,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:47,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:47,689 INFO L87 Difference]: Start difference. First operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 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 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:47,909 INFO L93 Difference]: Finished difference Result 1465 states and 2651 transitions. [2025-01-09 04:43:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:47,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:43:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:47,922 INFO L225 Difference]: With dead ends: 1465 [2025-01-09 04:43:47,922 INFO L226 Difference]: Without dead ends: 1288 [2025-01-09 04:43:47,925 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:43:47,927 INFO L435 NwaCegarLoop]: 2055 mSDtfsCounter, 969 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:47,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3330 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:43:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-01-09 04:43:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1280. [2025-01-09 04:43:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1273 states have (on average 1.3165750196386488) internal successors, (1676), 1279 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have 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:43:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1676 transitions. [2025-01-09 04:43:47,987 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1676 transitions. Word has length 64 [2025-01-09 04:43:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1676 transitions. [2025-01-09 04:43:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1676 transitions. [2025-01-09 04:43:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:43:47,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:47,991 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] [2025-01-09 04:43:47,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:43:47,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:47,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1978887998, now seen corresponding path program 1 times [2025-01-09 04:43:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334609010] [2025-01-09 04:43:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:48,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:43:48,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:43:48,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:48,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:48,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334609010] [2025-01-09 04:43:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334609010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:48,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090138616] [2025-01-09 04:43:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:48,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:48,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:48,182 INFO L87 Difference]: Start difference. First operand 1280 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:48,245 INFO L93 Difference]: Finished difference Result 1930 states and 2622 transitions. [2025-01-09 04:43:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:43:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:48,252 INFO L225 Difference]: With dead ends: 1930 [2025-01-09 04:43:48,252 INFO L226 Difference]: Without dead ends: 1576 [2025-01-09 04:43:48,254 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:43:48,254 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 717 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:48,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2315 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-09 04:43:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1568. [2025-01-09 04:43:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1561 states have (on average 1.3401665598975017) internal successors, (2092), 1567 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have 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:43:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2092 transitions. [2025-01-09 04:43:48,287 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2092 transitions. Word has length 64 [2025-01-09 04:43:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2092 transitions. [2025-01-09 04:43:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2092 transitions. [2025-01-09 04:43:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:43:48,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:48,291 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] [2025-01-09 04:43:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:43:48,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1566940908, now seen corresponding path program 1 times [2025-01-09 04:43:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513124353] [2025-01-09 04:43:48,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:48,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:43:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:43:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:48,450 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:43:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513124353] [2025-01-09 04:43:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513124353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:48,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:48,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103702657] [2025-01-09 04:43:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:48,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:48,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:48,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:48,452 INFO L87 Difference]: Start difference. First operand 1568 states and 2092 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:49,136 INFO L93 Difference]: Finished difference Result 3042 states and 4184 transitions. [2025-01-09 04:43:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:49,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:43:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:49,143 INFO L225 Difference]: With dead ends: 3042 [2025-01-09 04:43:49,144 INFO L226 Difference]: Without dead ends: 1783 [2025-01-09 04:43:49,145 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:43:49,148 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3665 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:49,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 834 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:43:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-01-09 04:43:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1775. [2025-01-09 04:43:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1768 states have (on average 1.3885746606334841) internal successors, (2455), 1774 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have 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:43:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2455 transitions. [2025-01-09 04:43:49,199 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2455 transitions. Word has length 64 [2025-01-09 04:43:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2455 transitions. [2025-01-09 04:43:49,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2455 transitions. [2025-01-09 04:43:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:43:49,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:49,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:49,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:43:49,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:49,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1913482263, now seen corresponding path program 1 times [2025-01-09 04:43:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197137735] [2025-01-09 04:43:49,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:43:49,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:43:49,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:49,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:49,327 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:43:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197137735] [2025-01-09 04:43:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197137735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:49,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750550955] [2025-01-09 04:43:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:49,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:49,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:49,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:49,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:49,331 INFO L87 Difference]: Start difference. First operand 1775 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:49,370 INFO L93 Difference]: Finished difference Result 3469 states and 4871 transitions. [2025-01-09 04:43:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:43:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:49,379 INFO L225 Difference]: With dead ends: 3469 [2025-01-09 04:43:49,380 INFO L226 Difference]: Without dead ends: 2489 [2025-01-09 04:43:49,381 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:43:49,384 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 897 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:49,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-01-09 04:43:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2477. [2025-01-09 04:43:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2470 states have (on average 1.374493927125506) internal successors, (3395), 2476 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have 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:43:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3395 transitions. [2025-01-09 04:43:49,431 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3395 transitions. Word has length 65 [2025-01-09 04:43:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:49,432 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3395 transitions. [2025-01-09 04:43:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3395 transitions. [2025-01-09 04:43:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:43:49,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:49,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:43:49,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1759204869, now seen corresponding path program 1 times [2025-01-09 04:43:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549216134] [2025-01-09 04:43:49,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:49,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:43:49,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:43:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:49,645 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:43:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549216134] [2025-01-09 04:43:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549216134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92101198] [2025-01-09 04:43:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:49,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:49,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:49,646 INFO L87 Difference]: Start difference. First operand 2477 states and 3395 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:50,225 INFO L93 Difference]: Finished difference Result 4728 states and 6563 transitions. [2025-01-09 04:43:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:43:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:50,240 INFO L225 Difference]: With dead ends: 4728 [2025-01-09 04:43:50,244 INFO L226 Difference]: Without dead ends: 2856 [2025-01-09 04:43:50,247 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:43:50,248 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 3060 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:50,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 696 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2025-01-09 04:43:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2842. [2025-01-09 04:43:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2835 states have (on average 1.366137566137566) internal successors, (3873), 2841 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have 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:43:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 3873 transitions. [2025-01-09 04:43:50,298 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 3873 transitions. Word has length 65 [2025-01-09 04:43:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 2842 states and 3873 transitions. [2025-01-09 04:43:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 3873 transitions. [2025-01-09 04:43:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:43:50,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:50,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:50,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:43:50,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:50,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1773849621, now seen corresponding path program 1 times [2025-01-09 04:43:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861591282] [2025-01-09 04:43:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:50,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:43:50,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:43:50,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:50,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:50,553 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:43:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861591282] [2025-01-09 04:43:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861591282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106911178] [2025-01-09 04:43:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:50,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:50,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:50,554 INFO L87 Difference]: Start difference. First operand 2842 states and 3873 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:50,923 INFO L93 Difference]: Finished difference Result 6738 states and 9400 transitions. [2025-01-09 04:43:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:43:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:50,935 INFO L225 Difference]: With dead ends: 6738 [2025-01-09 04:43:50,935 INFO L226 Difference]: Without dead ends: 4186 [2025-01-09 04:43:50,938 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:43:50,939 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2725 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:50,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 645 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2025-01-09 04:43:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 4178. [2025-01-09 04:43:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4171 states have (on average 1.3955885878686167) internal successors, (5821), 4177 states have internal predecessors, (5821), 0 states have call successors, (0), 0 states have 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:43:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 5821 transitions. [2025-01-09 04:43:51,021 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 5821 transitions. Word has length 65 [2025-01-09 04:43:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:51,022 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 5821 transitions. [2025-01-09 04:43:51,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 5821 transitions. [2025-01-09 04:43:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:43:51,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:51,025 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] [2025-01-09 04:43:51,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:43:51,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2076438910, now seen corresponding path program 1 times [2025-01-09 04:43:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555804652] [2025-01-09 04:43:51,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:43:51,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:43:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:51,092 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:43:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555804652] [2025-01-09 04:43:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555804652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839512916] [2025-01-09 04:43:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:51,094 INFO L87 Difference]: Start difference. First operand 4178 states and 5821 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:51,146 INFO L93 Difference]: Finished difference Result 8947 states and 12566 transitions. [2025-01-09 04:43:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:51,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:43:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:51,162 INFO L225 Difference]: With dead ends: 8947 [2025-01-09 04:43:51,162 INFO L226 Difference]: Without dead ends: 5787 [2025-01-09 04:43:51,166 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:43:51,167 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 584 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:51,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1530 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2025-01-09 04:43:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5761. [2025-01-09 04:43:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5761 states, 5754 states have (on average 1.3722627737226278) internal successors, (7896), 5760 states have internal predecessors, (7896), 0 states have call successors, (0), 0 states have 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:43:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5761 states to 5761 states and 7896 transitions. [2025-01-09 04:43:51,330 INFO L78 Accepts]: Start accepts. Automaton has 5761 states and 7896 transitions. Word has length 66 [2025-01-09 04:43:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:51,331 INFO L471 AbstractCegarLoop]: Abstraction has 5761 states and 7896 transitions. [2025-01-09 04:43:51,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5761 states and 7896 transitions. [2025-01-09 04:43:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:51,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:51,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:51,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:43:51,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1790108590, now seen corresponding path program 1 times [2025-01-09 04:43:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904441249] [2025-01-09 04:43:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:51,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:51,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:51,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:51,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:51,553 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:43:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:51,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904441249] [2025-01-09 04:43:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904441249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:51,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:51,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645620394] [2025-01-09 04:43:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:51,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:51,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:51,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:51,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:51,555 INFO L87 Difference]: Start difference. First operand 5761 states and 7896 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:51,969 INFO L93 Difference]: Finished difference Result 12941 states and 17876 transitions. [2025-01-09 04:43:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:51,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:43:51,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:52,001 INFO L225 Difference]: With dead ends: 12941 [2025-01-09 04:43:52,004 INFO L226 Difference]: Without dead ends: 7617 [2025-01-09 04:43:52,013 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:43:52,014 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 2385 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:52,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 580 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7617 states. [2025-01-09 04:43:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7617 to 7582. [2025-01-09 04:43:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7582 states, 7575 states have (on average 1.372145214521452) internal successors, (10394), 7581 states have internal predecessors, (10394), 0 states have call successors, (0), 0 states have 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:43:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 10394 transitions. [2025-01-09 04:43:52,240 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 10394 transitions. Word has length 67 [2025-01-09 04:43:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 7582 states and 10394 transitions. [2025-01-09 04:43:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 10394 transitions. [2025-01-09 04:43:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:52,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:43:52,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash 185593086, now seen corresponding path program 1 times [2025-01-09 04:43:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413638677] [2025-01-09 04:43:52,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:52,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:52,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:52,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:52,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:52,570 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:43:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413638677] [2025-01-09 04:43:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413638677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:52,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281674793] [2025-01-09 04:43:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:52,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:52,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:52,576 INFO L87 Difference]: Start difference. First operand 7582 states and 10394 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:53,278 INFO L93 Difference]: Finished difference Result 21804 states and 30442 transitions. [2025-01-09 04:43:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:53,304 INFO L225 Difference]: With dead ends: 21804 [2025-01-09 04:43:53,304 INFO L226 Difference]: Without dead ends: 18153 [2025-01-09 04:43:53,309 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:43:53,312 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3224 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:53,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3224 Valid, 1122 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:43:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18153 states. [2025-01-09 04:43:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18153 to 7650. [2025-01-09 04:43:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 7643 states have (on average 1.3714510009158707) internal successors, (10482), 7649 states have internal predecessors, (10482), 0 states have call successors, (0), 0 states have 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:43:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 10482 transitions. [2025-01-09 04:43:53,457 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 10482 transitions. Word has length 68 [2025-01-09 04:43:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:53,457 INFO L471 AbstractCegarLoop]: Abstraction has 7650 states and 10482 transitions. [2025-01-09 04:43:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 10482 transitions. [2025-01-09 04:43:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:53,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:53,462 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:43:53,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:43:53,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:53,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 290423248, now seen corresponding path program 1 times [2025-01-09 04:43:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409095132] [2025-01-09 04:43:53,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:53,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:53,808 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:43:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409095132] [2025-01-09 04:43:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409095132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:53,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398490488] [2025-01-09 04:43:53,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:53,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:53,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:53,811 INFO L87 Difference]: Start difference. First operand 7650 states and 10482 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:54,411 INFO L93 Difference]: Finished difference Result 19874 states and 27644 transitions. [2025-01-09 04:43:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:54,436 INFO L225 Difference]: With dead ends: 19874 [2025-01-09 04:43:54,436 INFO L226 Difference]: Without dead ends: 16405 [2025-01-09 04:43:54,443 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:43:54,444 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 3128 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:54,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3128 Valid, 1104 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16405 states. [2025-01-09 04:43:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16405 to 7772. [2025-01-09 04:43:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7772 states, 7765 states have (on average 1.3707662588538312) internal successors, (10644), 7771 states have internal predecessors, (10644), 0 states have call successors, (0), 0 states have 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:43:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 10644 transitions. [2025-01-09 04:43:54,610 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 10644 transitions. Word has length 68 [2025-01-09 04:43:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:54,611 INFO L471 AbstractCegarLoop]: Abstraction has 7772 states and 10644 transitions. [2025-01-09 04:43:54,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 10644 transitions. [2025-01-09 04:43:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:54,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:54,616 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:43:54,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:43:54,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -770234336, now seen corresponding path program 1 times [2025-01-09 04:43:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514092716] [2025-01-09 04:43:54,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:54,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:54,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:54,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:54,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:54,787 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:43:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514092716] [2025-01-09 04:43:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514092716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726282276] [2025-01-09 04:43:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:54,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:54,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:54,790 INFO L87 Difference]: Start difference. First operand 7772 states and 10644 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:55,580 INFO L93 Difference]: Finished difference Result 17994 states and 24916 transitions. [2025-01-09 04:43:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:55,603 INFO L225 Difference]: With dead ends: 17994 [2025-01-09 04:43:55,603 INFO L226 Difference]: Without dead ends: 14789 [2025-01-09 04:43:55,610 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:43:55,611 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 3051 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:55,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 1085 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:43:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14789 states. [2025-01-09 04:43:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14789 to 7843. [2025-01-09 04:43:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7843 states, 7836 states have (on average 1.3709800918836141) internal successors, (10743), 7842 states have internal predecessors, (10743), 0 states have call successors, (0), 0 states have 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:43:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7843 states to 7843 states and 10743 transitions. [2025-01-09 04:43:55,747 INFO L78 Accepts]: Start accepts. Automaton has 7843 states and 10743 transitions. Word has length 68 [2025-01-09 04:43:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 7843 states and 10743 transitions. [2025-01-09 04:43:55,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7843 states and 10743 transitions. [2025-01-09 04:43:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:55,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:55,753 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:43:55,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:43:55,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2053099389, now seen corresponding path program 1 times [2025-01-09 04:43:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050290177] [2025-01-09 04:43:55,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:55,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:55,901 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:43:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050290177] [2025-01-09 04:43:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050290177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:55,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:55,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145977950] [2025-01-09 04:43:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:55,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:55,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:55,902 INFO L87 Difference]: Start difference. First operand 7843 states and 10743 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:56,396 INFO L93 Difference]: Finished difference Result 16473 states and 22722 transitions. [2025-01-09 04:43:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:56,415 INFO L225 Difference]: With dead ends: 16473 [2025-01-09 04:43:56,415 INFO L226 Difference]: Without dead ends: 12802 [2025-01-09 04:43:56,423 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:43:56,424 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2880 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:56,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 1060 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:43:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2025-01-09 04:43:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 7878. [2025-01-09 04:43:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 7871 states have (on average 1.3706009401600814) internal successors, (10788), 7877 states have internal predecessors, (10788), 0 states have call successors, (0), 0 states have 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:43:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 10788 transitions. [2025-01-09 04:43:56,552 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 10788 transitions. Word has length 68 [2025-01-09 04:43:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 7878 states and 10788 transitions. [2025-01-09 04:43:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 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:43:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 10788 transitions. [2025-01-09 04:43:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:56,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:56,558 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:43:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:43:56,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash 43383936, now seen corresponding path program 1 times [2025-01-09 04:43:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434207032] [2025-01-09 04:43:56,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:56,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:56,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:56,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:56,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:56,933 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:43:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434207032] [2025-01-09 04:43:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434207032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:43:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601888273] [2025-01-09 04:43:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:43:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:56,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:43:56,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:43:56,934 INFO L87 Difference]: Start difference. First operand 7878 states and 10788 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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:43:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:57,741 INFO L93 Difference]: Finished difference Result 16535 states and 22985 transitions. [2025-01-09 04:43:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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:43:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:57,756 INFO L225 Difference]: With dead ends: 16535 [2025-01-09 04:43:57,756 INFO L226 Difference]: Without dead ends: 11022 [2025-01-09 04:43:57,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:57,761 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 2839 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:57,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 1558 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11022 states. [2025-01-09 04:43:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11022 to 7572. [2025-01-09 04:43:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7572 states, 7565 states have (on average 1.3688037012557832) internal successors, (10355), 7571 states have internal predecessors, (10355), 0 states have call successors, (0), 0 states have 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:43:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 10355 transitions. [2025-01-09 04:43:57,835 INFO L78 Accepts]: Start accepts. Automaton has 7572 states and 10355 transitions. Word has length 69 [2025-01-09 04:43:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:57,835 INFO L471 AbstractCegarLoop]: Abstraction has 7572 states and 10355 transitions. [2025-01-09 04:43:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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:43:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 10355 transitions. [2025-01-09 04:43:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:57,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:57,839 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:43:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:43:57,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 80806030, now seen corresponding path program 1 times [2025-01-09 04:43:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564042504] [2025-01-09 04:43:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:57,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:57,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:57,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:58,136 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:43:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564042504] [2025-01-09 04:43:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564042504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959184941] [2025-01-09 04:43:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:58,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:58,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:58,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:58,140 INFO L87 Difference]: Start difference. First operand 7572 states and 10355 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:43:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:59,139 INFO L93 Difference]: Finished difference Result 19708 states and 27444 transitions. [2025-01-09 04:43:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:43:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:43:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:59,155 INFO L225 Difference]: With dead ends: 19708 [2025-01-09 04:43:59,156 INFO L226 Difference]: Without dead ends: 14653 [2025-01-09 04:43:59,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:59,163 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 2497 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:59,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 2440 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:43:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14653 states. [2025-01-09 04:43:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14653 to 7437. [2025-01-09 04:43:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7437 states, 7430 states have (on average 1.3682368775235532) internal successors, (10166), 7436 states have internal predecessors, (10166), 0 states have call successors, (0), 0 states have 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:43:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7437 states to 7437 states and 10166 transitions. [2025-01-09 04:43:59,279 INFO L78 Accepts]: Start accepts. Automaton has 7437 states and 10166 transitions. Word has length 69 [2025-01-09 04:43:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 7437 states and 10166 transitions. [2025-01-09 04:43:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:43:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7437 states and 10166 transitions. [2025-01-09 04:43:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:59,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:59,284 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:43:59,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:43:59,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:43:59,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1560265185, now seen corresponding path program 1 times [2025-01-09 04:43:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491330046] [2025-01-09 04:43:59,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:59,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:59,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:59,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:59,700 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:43:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491330046] [2025-01-09 04:43:59,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491330046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:59,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134896116] [2025-01-09 04:43:59,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:59,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:59,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:59,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:59,702 INFO L87 Difference]: Start difference. First operand 7437 states and 10166 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:00,511 INFO L93 Difference]: Finished difference Result 16186 states and 22482 transitions. [2025-01-09 04:44:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:00,522 INFO L225 Difference]: With dead ends: 16186 [2025-01-09 04:44:00,522 INFO L226 Difference]: Without dead ends: 11355 [2025-01-09 04:44:00,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:44:00,528 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 3408 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3408 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:00,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3408 Valid, 1918 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:44:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2025-01-09 04:44:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 7413. [2025-01-09 04:44:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 7406 states have (on average 1.3674048069133136) internal successors, (10127), 7412 states have internal predecessors, (10127), 0 states have call successors, (0), 0 states have 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:44:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 10127 transitions. [2025-01-09 04:44:00,666 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 10127 transitions. Word has length 69 [2025-01-09 04:44:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:00,666 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 10127 transitions. [2025-01-09 04:44:00,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 10127 transitions. [2025-01-09 04:44:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:00,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:00,671 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:44:00,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:44:00,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1474423363, now seen corresponding path program 1 times [2025-01-09 04:44:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741647240] [2025-01-09 04:44:00,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:00,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:00,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:00,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:00,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:00,979 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:44:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741647240] [2025-01-09 04:44:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741647240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:00,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:44:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273047027] [2025-01-09 04:44:00,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:00,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:00,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:00,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:00,981 INFO L87 Difference]: Start difference. First operand 7413 states and 10127 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:01,752 INFO L93 Difference]: Finished difference Result 15991 states and 22199 transitions. [2025-01-09 04:44:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:01,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:01,765 INFO L225 Difference]: With dead ends: 15991 [2025-01-09 04:44:01,766 INFO L226 Difference]: Without dead ends: 11193 [2025-01-09 04:44:01,772 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:44:01,773 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 3400 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3400 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:01,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3400 Valid, 1900 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:44:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2025-01-09 04:44:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 7404. [2025-01-09 04:44:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7397 states have (on average 1.3667703122887658) internal successors, (10110), 7403 states have internal predecessors, (10110), 0 states have call successors, (0), 0 states have 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:44:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 10110 transitions. [2025-01-09 04:44:01,875 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 10110 transitions. Word has length 69 [2025-01-09 04:44:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 7404 states and 10110 transitions. [2025-01-09 04:44:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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:44:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 10110 transitions. [2025-01-09 04:44:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:01,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:01,880 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:44:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:44:01,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -688548458, now seen corresponding path program 1 times [2025-01-09 04:44:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19472915] [2025-01-09 04:44:01,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:01,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:01,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:01,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:02,695 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:44:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19472915] [2025-01-09 04:44:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19472915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:44:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090275915] [2025-01-09 04:44:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:02,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:44:02,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:02,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:44:02,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:44:02,697 INFO L87 Difference]: Start difference. First operand 7404 states and 10110 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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:44:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:03,929 INFO L93 Difference]: Finished difference Result 25731 states and 35950 transitions. [2025-01-09 04:44:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:44:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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:44:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:03,951 INFO L225 Difference]: With dead ends: 25731 [2025-01-09 04:44:03,951 INFO L226 Difference]: Without dead ends: 20936 [2025-01-09 04:44:03,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:44:03,963 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 4514 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4514 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:03,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4514 Valid, 4741 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:44:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20936 states. [2025-01-09 04:44:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20936 to 7390. [2025-01-09 04:44:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 7384 states have (on average 1.3657908992416035) internal successors, (10085), 7389 states have internal predecessors, (10085), 0 states have call successors, (0), 0 states have 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:44:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10085 transitions. [2025-01-09 04:44:04,153 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10085 transitions. Word has length 70 [2025-01-09 04:44:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:04,153 INFO L471 AbstractCegarLoop]: Abstraction has 7390 states and 10085 transitions. [2025-01-09 04:44:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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:44:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10085 transitions. [2025-01-09 04:44:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:04,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:04,158 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:44:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:44:04,158 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:04,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1142484158, now seen corresponding path program 1 times [2025-01-09 04:44:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:04,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798251929] [2025-01-09 04:44:04,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:04,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:04,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:04,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:04,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:04,804 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:44:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798251929] [2025-01-09 04:44:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798251929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:44:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132836229] [2025-01-09 04:44:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:44:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:44:04,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:44:04,805 INFO L87 Difference]: Start difference. First operand 7390 states and 10085 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:44:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:05,452 INFO L93 Difference]: Finished difference Result 24282 states and 33936 transitions. [2025-01-09 04:44:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:44:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:05,470 INFO L225 Difference]: With dead ends: 24282 [2025-01-09 04:44:05,470 INFO L226 Difference]: Without dead ends: 19225 [2025-01-09 04:44:05,479 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:44:05,479 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 3942 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3942 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:05,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3942 Valid, 2306 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19225 states. [2025-01-09 04:44:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19225 to 7141. [2025-01-09 04:44:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 7136 states have (on average 1.3628082959641257) internal successors, (9725), 7140 states have internal predecessors, (9725), 0 states have call successors, (0), 0 states have 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:44:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 9725 transitions. [2025-01-09 04:44:05,669 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 9725 transitions. Word has length 70 [2025-01-09 04:44:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:05,669 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 9725 transitions. [2025-01-09 04:44:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:44:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 9725 transitions. [2025-01-09 04:44:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:05,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:05,677 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:44:05,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:44:05,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:05,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1346201798, now seen corresponding path program 1 times [2025-01-09 04:44:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228034728] [2025-01-09 04:44:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:05,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:05,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:05,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:05,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:05,788 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:44:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228034728] [2025-01-09 04:44:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228034728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130838074] [2025-01-09 04:44:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:05,793 INFO L87 Difference]: Start difference. First operand 7141 states and 9725 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:44:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:05,854 INFO L93 Difference]: Finished difference Result 10863 states and 14917 transitions. [2025-01-09 04:44:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:05,855 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:44:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:05,861 INFO L225 Difference]: With dead ends: 10863 [2025-01-09 04:44:05,865 INFO L226 Difference]: Without dead ends: 7147 [2025-01-09 04:44:05,869 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:44:05,874 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 427 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:05,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1356 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2025-01-09 04:44:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 7141. [2025-01-09 04:44:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 7136 states have (on average 1.3531390134529149) internal successors, (9656), 7140 states have internal predecessors, (9656), 0 states have call successors, (0), 0 states have 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:44:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 9656 transitions. [2025-01-09 04:44:06,078 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 9656 transitions. Word has length 70 [2025-01-09 04:44:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:06,078 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 9656 transitions. [2025-01-09 04:44:06,078 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:44:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 9656 transitions. [2025-01-09 04:44:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:06,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:06,086 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:44:06,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:44:06,087 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1360936426, now seen corresponding path program 1 times [2025-01-09 04:44:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673800478] [2025-01-09 04:44:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:06,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:06,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:06,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:06,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:06,583 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:44:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673800478] [2025-01-09 04:44:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673800478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:44:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663655955] [2025-01-09 04:44:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:44:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:06,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:44:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:06,585 INFO L87 Difference]: Start difference. First operand 7141 states and 9656 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:44:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,076 INFO L93 Difference]: Finished difference Result 15141 states and 20872 transitions. [2025-01-09 04:44:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:44:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,085 INFO L225 Difference]: With dead ends: 15141 [2025-01-09 04:44:07,085 INFO L226 Difference]: Without dead ends: 10081 [2025-01-09 04:44:07,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:44:07,090 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 3396 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 2790 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10081 states. [2025-01-09 04:44:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10081 to 6856. [2025-01-09 04:44:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6856 states, 6853 states have (on average 1.3544433094994892) internal successors, (9282), 6855 states have internal predecessors, (9282), 0 states have call successors, (0), 0 states have 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:44:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 9282 transitions. [2025-01-09 04:44:07,161 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 9282 transitions. Word has length 70 [2025-01-09 04:44:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,161 INFO L471 AbstractCegarLoop]: Abstraction has 6856 states and 9282 transitions. [2025-01-09 04:44:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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:44:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 9282 transitions. [2025-01-09 04:44:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:44:07,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,164 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] [2025-01-09 04:44:07,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:44:07,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:07,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -452169058, now seen corresponding path program 1 times [2025-01-09 04:44:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71187752] [2025-01-09 04:44:07,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:44:07,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:44:07,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:07,262 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:44:07,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:07,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71187752] [2025-01-09 04:44:07,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71187752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:07,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796596469] [2025-01-09 04:44:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:07,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:07,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:07,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:07,265 INFO L87 Difference]: Start difference. First operand 6856 states and 9282 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,348 INFO L93 Difference]: Finished difference Result 13940 states and 19100 transitions. [2025-01-09 04:44:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:07,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:44:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,357 INFO L225 Difference]: With dead ends: 13940 [2025-01-09 04:44:07,357 INFO L226 Difference]: Without dead ends: 9715 [2025-01-09 04:44:07,361 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:44:07,362 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 380 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 526 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9715 states. [2025-01-09 04:44:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9715 to 9686. [2025-01-09 04:44:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9686 states, 9685 states have (on average 1.3751161590087764) internal successors, (13318), 9685 states have internal predecessors, (13318), 0 states have call successors, (0), 0 states have 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:44:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9686 states to 9686 states and 13318 transitions. [2025-01-09 04:44:07,441 INFO L78 Accepts]: Start accepts. Automaton has 9686 states and 13318 transitions. Word has length 72 [2025-01-09 04:44:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 9686 states and 13318 transitions. [2025-01-09 04:44:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9686 states and 13318 transitions. [2025-01-09 04:44:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:07,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:07,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:44:07,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -786160929, now seen corresponding path program 1 times [2025-01-09 04:44:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642273994] [2025-01-09 04:44:07,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:07,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:07,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:07,610 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:44:07,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642273994] [2025-01-09 04:44:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642273994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069546574] [2025-01-09 04:44:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:07,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:07,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:07,612 INFO L87 Difference]: Start difference. First operand 9686 states and 13318 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,759 INFO L93 Difference]: Finished difference Result 43788 states and 61665 transitions. [2025-01-09 04:44:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 04:44:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,797 INFO L225 Difference]: With dead ends: 43788 [2025-01-09 04:44:07,798 INFO L226 Difference]: Without dead ends: 35929 [2025-01-09 04:44:07,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:07,815 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 2043 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1218 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35929 states. [2025-01-09 04:44:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35929 to 17543. [2025-01-09 04:44:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17543 states, 17542 states have (on average 1.3789761714741762) internal successors, (24190), 17542 states have internal predecessors, (24190), 0 states have call successors, (0), 0 states have 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:44:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17543 states to 17543 states and 24190 transitions. [2025-01-09 04:44:08,210 INFO L78 Accepts]: Start accepts. Automaton has 17543 states and 24190 transitions. Word has length 86 [2025-01-09 04:44:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:08,210 INFO L471 AbstractCegarLoop]: Abstraction has 17543 states and 24190 transitions. [2025-01-09 04:44:08,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17543 states and 24190 transitions. [2025-01-09 04:44:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:44:08,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:08,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:08,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:44:08,231 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 623918678, now seen corresponding path program 1 times [2025-01-09 04:44:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:08,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177642415] [2025-01-09 04:44:08,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:08,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:44:08,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:44:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:08,417 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:44:08,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177642415] [2025-01-09 04:44:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177642415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518248321] [2025-01-09 04:44:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:08,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:08,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:08,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:08,419 INFO L87 Difference]: Start difference. First operand 17543 states and 24190 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:08,640 INFO L93 Difference]: Finished difference Result 28217 states and 38845 transitions. [2025-01-09 04:44:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:44:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:08,655 INFO L225 Difference]: With dead ends: 28217 [2025-01-09 04:44:08,655 INFO L226 Difference]: Without dead ends: 18623 [2025-01-09 04:44:08,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:08,663 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1157 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:08,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1182 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18623 states. [2025-01-09 04:44:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18623 to 13367. [2025-01-09 04:44:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13367 states, 13366 states have (on average 1.3563519377525064) internal successors, (18129), 13366 states have internal predecessors, (18129), 0 states have call successors, (0), 0 states have 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:44:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13367 states to 13367 states and 18129 transitions. [2025-01-09 04:44:08,945 INFO L78 Accepts]: Start accepts. Automaton has 13367 states and 18129 transitions. Word has length 87 [2025-01-09 04:44:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:08,946 INFO L471 AbstractCegarLoop]: Abstraction has 13367 states and 18129 transitions. [2025-01-09 04:44:08,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 13367 states and 18129 transitions. [2025-01-09 04:44:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:44:08,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:08,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:08,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:44:08,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 803271302, now seen corresponding path program 1 times [2025-01-09 04:44:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:08,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394993100] [2025-01-09 04:44:08,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:08,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:44:08,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:44:08,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:08,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:09,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:44:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394993100] [2025-01-09 04:44:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394993100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158799147] [2025-01-09 04:44:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:09,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:09,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:09,058 INFO L87 Difference]: Start difference. First operand 13367 states and 18129 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have 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:44:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:09,137 INFO L93 Difference]: Finished difference Result 36039 states and 49333 transitions. [2025-01-09 04:44:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 04:44:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:09,165 INFO L225 Difference]: With dead ends: 36039 [2025-01-09 04:44:09,166 INFO L226 Difference]: Without dead ends: 24333 [2025-01-09 04:44:09,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:44:09,181 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 154 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:09,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 883 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24333 states. [2025-01-09 04:44:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24333 to 22915. [2025-01-09 04:44:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22915 states, 22914 states have (on average 1.3585144453172733) internal successors, (31129), 22914 states have internal predecessors, (31129), 0 states have call successors, (0), 0 states have 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:44:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22915 states to 22915 states and 31129 transitions. [2025-01-09 04:44:09,625 INFO L78 Accepts]: Start accepts. Automaton has 22915 states and 31129 transitions. Word has length 88 [2025-01-09 04:44:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:09,625 INFO L471 AbstractCegarLoop]: Abstraction has 22915 states and 31129 transitions. [2025-01-09 04:44:09,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have 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:44:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22915 states and 31129 transitions. [2025-01-09 04:44:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:44:09,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:09,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:09,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:44:09,641 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 195252509, now seen corresponding path program 1 times [2025-01-09 04:44:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696455673] [2025-01-09 04:44:09,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:09,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:44:09,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:44:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:09,833 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:44:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696455673] [2025-01-09 04:44:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696455673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657572715] [2025-01-09 04:44:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:09,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:09,834 INFO L87 Difference]: Start difference. First operand 22915 states and 31129 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:44:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:10,091 INFO L93 Difference]: Finished difference Result 64023 states and 87227 transitions. [2025-01-09 04:44:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 89 [2025-01-09 04:44:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:10,133 INFO L225 Difference]: With dead ends: 64023 [2025-01-09 04:44:10,133 INFO L226 Difference]: Without dead ends: 42769 [2025-01-09 04:44:10,148 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:44:10,148 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 142 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 872 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:10,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 872 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42769 states. [2025-01-09 04:44:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42769 to 39903. [2025-01-09 04:44:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39903 states, 39902 states have (on average 1.3475264397774547) internal successors, (53769), 39902 states have internal predecessors, (53769), 0 states have call successors, (0), 0 states have 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:44:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39903 states to 39903 states and 53769 transitions. [2025-01-09 04:44:10,588 INFO L78 Accepts]: Start accepts. Automaton has 39903 states and 53769 transitions. Word has length 89 [2025-01-09 04:44:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:10,589 INFO L471 AbstractCegarLoop]: Abstraction has 39903 states and 53769 transitions. [2025-01-09 04:44:10,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:44:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39903 states and 53769 transitions. [2025-01-09 04:44:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:44:10,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:10,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:10,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:44:10,598 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:10,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1615072029, now seen corresponding path program 1 times [2025-01-09 04:44:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664866004] [2025-01-09 04:44:10,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:44:10,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:44:10,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:10,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:10,677 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:44:10,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:10,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664866004] [2025-01-09 04:44:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664866004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:10,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516755466] [2025-01-09 04:44:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:10,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:10,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:10,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:10,678 INFO L87 Difference]: Start difference. First operand 39903 states and 53769 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:10,820 INFO L93 Difference]: Finished difference Result 55708 states and 75098 transitions. [2025-01-09 04:44:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:44:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:10,859 INFO L225 Difference]: With dead ends: 55708 [2025-01-09 04:44:10,860 INFO L226 Difference]: Without dead ends: 32513 [2025-01-09 04:44:10,881 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:44:10,882 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 241 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:10,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 917 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32513 states. [2025-01-09 04:44:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32513 to 32511. [2025-01-09 04:44:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32511 states, 32510 states have (on average 1.340479852353122) internal successors, (43579), 32510 states have internal predecessors, (43579), 0 states have call successors, (0), 0 states have 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:44:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32511 states to 32511 states and 43579 transitions. [2025-01-09 04:44:11,386 INFO L78 Accepts]: Start accepts. Automaton has 32511 states and 43579 transitions. Word has length 90 [2025-01-09 04:44:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:11,386 INFO L471 AbstractCegarLoop]: Abstraction has 32511 states and 43579 transitions. [2025-01-09 04:44:11,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32511 states and 43579 transitions. [2025-01-09 04:44:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:44:11,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:11,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:11,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:44:11,394 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -992280540, now seen corresponding path program 1 times [2025-01-09 04:44:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65205746] [2025-01-09 04:44:11,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:44:11,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:44:11,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:11,474 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:44:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65205746] [2025-01-09 04:44:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65205746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806829601] [2025-01-09 04:44:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:11,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:11,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:11,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:11,476 INFO L87 Difference]: Start difference. First operand 32511 states and 43579 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:11,807 INFO L93 Difference]: Finished difference Result 92107 states and 123429 transitions. [2025-01-09 04:44:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:44:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:11,882 INFO L225 Difference]: With dead ends: 92107 [2025-01-09 04:44:11,883 INFO L226 Difference]: Without dead ends: 61209 [2025-01-09 04:44:11,900 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:44:11,900 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 129 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:11,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 854 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61209 states. [2025-01-09 04:44:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61209 to 56775. [2025-01-09 04:44:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56775 states, 56774 states have (on average 1.322770986719273) internal successors, (75099), 56774 states have internal predecessors, (75099), 0 states have call successors, (0), 0 states have 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:44:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 75099 transitions. [2025-01-09 04:44:12,467 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 75099 transitions. Word has length 90 [2025-01-09 04:44:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 56775 states and 75099 transitions. [2025-01-09 04:44:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 75099 transitions. [2025-01-09 04:44:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:44:12,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:12,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:12,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:44:12,473 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:12,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1918040975, now seen corresponding path program 1 times [2025-01-09 04:44:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398192256] [2025-01-09 04:44:12,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:12,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:44:12,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:44:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:12,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398192256] [2025-01-09 04:44:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398192256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165595952] [2025-01-09 04:44:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:12,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:12,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:12,533 INFO L87 Difference]: Start difference. First operand 56775 states and 75099 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:12,838 INFO L93 Difference]: Finished difference Result 69751 states and 92387 transitions. [2025-01-09 04:44:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 04:44:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:12,891 INFO L225 Difference]: With dead ends: 69751 [2025-01-09 04:44:12,892 INFO L226 Difference]: Without dead ends: 46418 [2025-01-09 04:44:12,917 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:44:12,918 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 198 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:12,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 885 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46418 states. [2025-01-09 04:44:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46418 to 46416. [2025-01-09 04:44:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46416 states, 46415 states have (on average 1.3234299256705806) internal successors, (61427), 46415 states have internal predecessors, (61427), 0 states have call successors, (0), 0 states have 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:44:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46416 states to 46416 states and 61427 transitions. [2025-01-09 04:44:13,490 INFO L78 Accepts]: Start accepts. Automaton has 46416 states and 61427 transitions. Word has length 91 [2025-01-09 04:44:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 46416 states and 61427 transitions. [2025-01-09 04:44:13,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46416 states and 61427 transitions. [2025-01-09 04:44:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:44:13,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:13,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:13,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:44:13,496 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:13,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1248064469, now seen corresponding path program 1 times [2025-01-09 04:44:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574376108] [2025-01-09 04:44:13,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:44:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:44:13,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:13,580 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:44:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574376108] [2025-01-09 04:44:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574376108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776670515] [2025-01-09 04:44:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:13,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:13,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:13,581 INFO L87 Difference]: Start difference. First operand 46416 states and 61427 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:13,995 INFO L93 Difference]: Finished difference Result 132468 states and 175077 transitions. [2025-01-09 04:44:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:44:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:14,089 INFO L225 Difference]: With dead ends: 132468 [2025-01-09 04:44:14,089 INFO L226 Difference]: Without dead ends: 87602 [2025-01-09 04:44:14,128 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:44:14,129 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 107 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:14,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 834 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87602 states. [2025-01-09 04:44:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87602 to 81968. [2025-01-09 04:44:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81968 states, 81967 states have (on average 1.310808008100821) internal successors, (107443), 81967 states have internal predecessors, (107443), 0 states have call successors, (0), 0 states have 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:44:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81968 states to 81968 states and 107443 transitions. [2025-01-09 04:44:15,109 INFO L78 Accepts]: Start accepts. Automaton has 81968 states and 107443 transitions. Word has length 92 [2025-01-09 04:44:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 81968 states and 107443 transitions. [2025-01-09 04:44:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 81968 states and 107443 transitions. [2025-01-09 04:44:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:44:15,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:15,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:44:15,115 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -290315974, now seen corresponding path program 1 times [2025-01-09 04:44:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843752508] [2025-01-09 04:44:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:15,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:44:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:44:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:15,329 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:44:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843752508] [2025-01-09 04:44:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843752508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110169082] [2025-01-09 04:44:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:15,331 INFO L87 Difference]: Start difference. First operand 81968 states and 107443 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:15,706 INFO L93 Difference]: Finished difference Result 88210 states and 115764 transitions. [2025-01-09 04:44:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:44:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:15,799 INFO L225 Difference]: With dead ends: 88210 [2025-01-09 04:44:15,799 INFO L226 Difference]: Without dead ends: 88208 [2025-01-09 04:44:15,825 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:44:15,830 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 0 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:15,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2071 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88208 states. [2025-01-09 04:44:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88208 to 88208. [2025-01-09 04:44:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88208 states, 88207 states have (on average 1.2888206151439228) internal successors, (113683), 88207 states have internal predecessors, (113683), 0 states have call successors, (0), 0 states have 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:44:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88208 states to 88208 states and 113683 transitions. [2025-01-09 04:44:16,890 INFO L78 Accepts]: Start accepts. Automaton has 88208 states and 113683 transitions. Word has length 94 [2025-01-09 04:44:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:16,890 INFO L471 AbstractCegarLoop]: Abstraction has 88208 states and 113683 transitions. [2025-01-09 04:44:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 88208 states and 113683 transitions. [2025-01-09 04:44:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:16,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:16,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:16,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:44:16,895 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 95243205, now seen corresponding path program 1 times [2025-01-09 04:44:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280103046] [2025-01-09 04:44:16,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:16,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:16,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:16,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:16,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:16,987 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:44:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280103046] [2025-01-09 04:44:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280103046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364806613] [2025-01-09 04:44:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:16,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:16,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:16,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:16,988 INFO L87 Difference]: Start difference. First operand 88208 states and 113683 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,721 INFO L93 Difference]: Finished difference Result 222380 states and 285181 transitions. [2025-01-09 04:44:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:44:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,884 INFO L225 Difference]: With dead ends: 222380 [2025-01-09 04:44:17,884 INFO L226 Difference]: Without dead ends: 135722 [2025-01-09 04:44:17,921 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:44:17,921 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 325 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 610 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135722 states. [2025-01-09 04:44:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135722 to 135720. [2025-01-09 04:44:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135720 states, 135719 states have (on average 1.2692916982883753) internal successors, (172267), 135719 states have internal predecessors, (172267), 0 states have call successors, (0), 0 states have 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:44:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135720 states to 135720 states and 172267 transitions. [2025-01-09 04:44:19,691 INFO L78 Accepts]: Start accepts. Automaton has 135720 states and 172267 transitions. Word has length 95 [2025-01-09 04:44:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 135720 states and 172267 transitions. [2025-01-09 04:44:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 135720 states and 172267 transitions. [2025-01-09 04:44:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:44:19,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:44:19,696 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1137070122, now seen corresponding path program 1 times [2025-01-09 04:44:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525323982] [2025-01-09 04:44:19,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:44:19,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:44:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:19,782 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:44:19,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525323982] [2025-01-09 04:44:19,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525323982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:19,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375046810] [2025-01-09 04:44:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:19,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:19,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:19,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:19,785 INFO L87 Difference]: Start difference. First operand 135720 states and 172267 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,340 INFO L93 Difference]: Finished difference Result 211170 states and 269192 transitions. [2025-01-09 04:44:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:20,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:44:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,886 INFO L225 Difference]: With dead ends: 211170 [2025-01-09 04:44:20,887 INFO L226 Difference]: Without dead ends: 181756 [2025-01-09 04:44:20,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:20,937 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1578 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:20,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1305 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181756 states. [2025-01-09 04:44:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181756 to 155876. [2025-01-09 04:44:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155876 states, 155875 states have (on average 1.2671884522854853) internal successors, (197523), 155875 states have internal predecessors, (197523), 0 states have call successors, (0), 0 states have 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:44:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155876 states to 155876 states and 197523 transitions. [2025-01-09 04:44:23,162 INFO L78 Accepts]: Start accepts. Automaton has 155876 states and 197523 transitions. Word has length 97 [2025-01-09 04:44:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:23,162 INFO L471 AbstractCegarLoop]: Abstraction has 155876 states and 197523 transitions. [2025-01-09 04:44:23,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 155876 states and 197523 transitions. [2025-01-09 04:44:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:44:23,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:23,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:44:23,167 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -66918083, now seen corresponding path program 1 times [2025-01-09 04:44:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240624333] [2025-01-09 04:44:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:23,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:44:23,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:44:23,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:23,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240624333] [2025-01-09 04:44:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240624333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121740845] [2025-01-09 04:44:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:23,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:23,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:23,259 INFO L87 Difference]: Start difference. First operand 155876 states and 197523 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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:44:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:23,959 INFO L93 Difference]: Finished difference Result 309321 states and 391949 transitions. [2025-01-09 04:44:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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:44:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:24,707 INFO L225 Difference]: With dead ends: 309321 [2025-01-09 04:44:24,708 INFO L226 Difference]: Without dead ends: 220024 [2025-01-09 04:44:24,783 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:44:24,784 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 375 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:24,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 567 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220024 states. [2025-01-09 04:44:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220024 to 153484. [2025-01-09 04:44:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153484 states, 153483 states have (on average 1.264198640891825) internal successors, (194033), 153483 states have internal predecessors, (194033), 0 states have call successors, (0), 0 states have 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:44:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153484 states to 153484 states and 194033 transitions. [2025-01-09 04:44:26,875 INFO L78 Accepts]: Start accepts. Automaton has 153484 states and 194033 transitions. Word has length 98 [2025-01-09 04:44:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 153484 states and 194033 transitions. [2025-01-09 04:44:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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:44:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 153484 states and 194033 transitions. [2025-01-09 04:44:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:44:26,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:26,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:26,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:44:26,880 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:26,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1368723189, now seen corresponding path program 1 times [2025-01-09 04:44:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241629535] [2025-01-09 04:44:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:26,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:44:26,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:44:26,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:26,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:27,127 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:44:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241629535] [2025-01-09 04:44:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241629535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:27,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764537316] [2025-01-09 04:44:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:27,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:27,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:27,132 INFO L87 Difference]: Start difference. First operand 153484 states and 194033 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:27,935 INFO L93 Difference]: Finished difference Result 216890 states and 275230 transitions. [2025-01-09 04:44:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 04:44:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:28,182 INFO L225 Difference]: With dead ends: 216890 [2025-01-09 04:44:28,182 INFO L226 Difference]: Without dead ends: 188340 [2025-01-09 04:44:28,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:28,256 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 1575 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:28,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 1287 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188340 states. [2025-01-09 04:44:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188340 to 173160. [2025-01-09 04:44:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173160 states, 173159 states have (on average 1.2622445267066684) internal successors, (218569), 173159 states have internal predecessors, (218569), 0 states have call successors, (0), 0 states have 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:44:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173160 states to 173160 states and 218569 transitions. [2025-01-09 04:44:30,327 INFO L78 Accepts]: Start accepts. Automaton has 173160 states and 218569 transitions. Word has length 99 [2025-01-09 04:44:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 173160 states and 218569 transitions. [2025-01-09 04:44:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 173160 states and 218569 transitions. [2025-01-09 04:44:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:44:30,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:30,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:44:30,348 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:30,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 279266524, now seen corresponding path program 1 times [2025-01-09 04:44:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:30,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231082668] [2025-01-09 04:44:30,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:30,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:31,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231082668] [2025-01-09 04:44:31,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231082668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794789817] [2025-01-09 04:44:31,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:31,004 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:44:31,006 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:44:31,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:31,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:31,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:31,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:44:31,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:44:31,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:44:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794789817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:44:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-01-09 04:44:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68383644] [2025-01-09 04:44:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:31,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:31,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:31,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:44:31,715 INFO L87 Difference]: Start difference. First operand 173160 states and 218569 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:44:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:33,539 INFO L93 Difference]: Finished difference Result 468148 states and 590696 transitions. [2025-01-09 04:44:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:44:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2025-01-09 04:44:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:34,098 INFO L225 Difference]: With dead ends: 468148 [2025-01-09 04:44:34,098 INFO L226 Difference]: Without dead ends: 392754 [2025-01-09 04:44:34,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:44:34,243 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1236 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:34,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1317 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392754 states. [2025-01-09 04:44:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392754 to 173096. [2025-01-09 04:44:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173096 states, 173095 states have (on average 1.2622317224645425) internal successors, (218486), 173095 states have internal predecessors, (218486), 0 states have call successors, (0), 0 states have 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:44:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173096 states to 173096 states and 218486 transitions. [2025-01-09 04:44:37,783 INFO L78 Accepts]: Start accepts. Automaton has 173096 states and 218486 transitions. Word has length 121 [2025-01-09 04:44:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:37,783 INFO L471 AbstractCegarLoop]: Abstraction has 173096 states and 218486 transitions. [2025-01-09 04:44:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:44:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 173096 states and 218486 transitions. [2025-01-09 04:44:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:44:37,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:37,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:37,809 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:44:38,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-01-09 04:44:38,002 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:38,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:38,002 INFO L85 PathProgramCache]: Analyzing trace with hash -30963017, now seen corresponding path program 1 times [2025-01-09 04:44:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010230261] [2025-01-09 04:44:38,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:38,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:38,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:38,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010230261] [2025-01-09 04:44:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010230261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:38,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976117059] [2025-01-09 04:44:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:38,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:38,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:38,547 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:44:38,551 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:44:38,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:38,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:38,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:38,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:44:38,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:39,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:44:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976117059] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:44:40,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:44:40,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 04:44:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479932375] [2025-01-09 04:44:40,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:44:40,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:44:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:40,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:44:40,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:44:40,729 INFO L87 Difference]: Start difference. First operand 173096 states and 218486 transitions. Second operand has 26 states, 26 states have (on average 12.0) internal successors, (312), 25 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:44:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:42,983 INFO L93 Difference]: Finished difference Result 425125 states and 536455 transitions. [2025-01-09 04:44:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 04:44:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.0) internal successors, (312), 25 states have internal predecessors, (312), 0 states have call successors, (0), 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 121 [2025-01-09 04:44:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:43,375 INFO L225 Difference]: With dead ends: 425125 [2025-01-09 04:44:43,375 INFO L226 Difference]: Without dead ends: 340743 [2025-01-09 04:44:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 04:44:43,459 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2985 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2985 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:43,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2985 Valid, 3044 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:44:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340743 states. [2025-01-09 04:44:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340743 to 291225.