./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.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.UNBOUNDED.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 820426658db97058309ccbf6c9080e1e23ba9878004c38e814dfcfedaf40875a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:43:53,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:43:53,978 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:53,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:43:53,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:43:54,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:43:54,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:43:54,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:43:54,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:43:54,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:43:54,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:43:54,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:43:54,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:43:54,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:43:54,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:54,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:54,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:43:54,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:43:54,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:43:54,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:43:54,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:43:54,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:43:54,007 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 -> 820426658db97058309ccbf6c9080e1e23ba9878004c38e814dfcfedaf40875a [2025-01-09 04:43:54,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:43:54,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:43:54,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:43:54,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:43:54,232 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:43:54,233 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:43:55,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5af23f60/45d8b0ef1bef4f89aa875cbad171dfe0/FLAG414d77d0b [2025-01-09 04:43:55,837 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:43:55,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:43:55,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5af23f60/45d8b0ef1bef4f89aa875cbad171dfe0/FLAG414d77d0b [2025-01-09 04:43:55,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5af23f60/45d8b0ef1bef4f89aa875cbad171dfe0 [2025-01-09 04:43:55,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:43:55,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:43:55,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:43:55,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:43:55,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:43:55,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:55" (1/1) ... [2025-01-09 04:43:55,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edcc854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:55, skipping insertion in model container [2025-01-09 04:43:55,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:55" (1/1) ... [2025-01-09 04:43:55,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:43:56,190 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.UNBOUNDED.pals.c.v+lhb-reducer.c[11898,11911] [2025-01-09 04:43:56,212 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18616,18629] [2025-01-09 04:43:56,220 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20814,20827] [2025-01-09 04:43:56,223 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21891,21904] [2025-01-09 04:43:56,232 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.UNBOUNDED.pals.c.v+lhb-reducer.c[25244,25257] [2025-01-09 04:43:56,235 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26324,26337] [2025-01-09 04:43:56,249 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.UNBOUNDED.pals.c.v+lhb-reducer.c[28553,28566] [2025-01-09 04:43:56,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:43:56,497 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:43:56,525 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.UNBOUNDED.pals.c.v+lhb-reducer.c[11898,11911] [2025-01-09 04:43:56,538 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18616,18629] [2025-01-09 04:43:56,543 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20814,20827] [2025-01-09 04:43:56,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21891,21904] [2025-01-09 04:43:56,552 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.UNBOUNDED.pals.c.v+lhb-reducer.c[25244,25257] [2025-01-09 04:43:56,555 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26324,26337] [2025-01-09 04:43:56,558 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.UNBOUNDED.pals.c.v+lhb-reducer.c[28553,28566] [2025-01-09 04:43:56,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:43:56,750 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:43:56,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:56 WrapperNode [2025-01-09 04:43:56,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:43:56,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:43:56,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:43:56,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:43:56,757 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:56" (1/1) ... [2025-01-09 04:43:56,786 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:56" (1/1) ... [2025-01-09 04:43:56,891 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7044 [2025-01-09 04:43:56,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:43:56,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:43:56,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:43:56,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:43:56,898 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:56" (1/1) ... [2025-01-09 04:43:56,899 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:56" (1/1) ... [2025-01-09 04:43:56,917 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:56" (1/1) ... [2025-01-09 04:43:57,012 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:57,012 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:56" (1/1) ... [2025-01-09 04:43:57,013 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:56" (1/1) ... [2025-01-09 04:43:57,055 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:56" (1/1) ... [2025-01-09 04:43:57,061 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:56" (1/1) ... [2025-01-09 04:43:57,083 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:56" (1/1) ... [2025-01-09 04:43:57,099 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:56" (1/1) ... [2025-01-09 04:43:57,110 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:56" (1/1) ... [2025-01-09 04:43:57,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:43:57,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:43:57,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:43:57,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:43:57,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:56" (1/1) ... [2025-01-09 04:43:57,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:43:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:43:57,156 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:57,159 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:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:43:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:43:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:43:57,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:43:57,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:43:57,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:44:00,049 INFO L? ?]: Removed 1112 outVars from TransFormulas that were not future-live. [2025-01-09 04:44:00,049 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:44:00,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:44:00,089 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:44:00,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:00 BoogieIcfgContainer [2025-01-09 04:44:00,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:44:00,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:44:00,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:44:00,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:44:00,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:55" (1/3) ... [2025-01-09 04:44:00,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dbe0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:00, skipping insertion in model container [2025-01-09 04:44:00,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:56" (2/3) ... [2025-01-09 04:44:00,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dbe0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:00, skipping insertion in model container [2025-01-09 04:44:00,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:00" (3/3) ... [2025-01-09 04:44:00,101 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:44:00,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:44:00,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1102 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-01-09 04:44:00,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:44:00,201 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;@2739f493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:44:00,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 04:44:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have 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,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:44:00,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:00,236 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] [2025-01-09 04:44:00,236 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:44:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1027637325, now seen corresponding path program 1 times [2025-01-09 04:44:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868913012] [2025-01-09 04:44:00,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:00,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:44:00,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:44:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:00,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:00,817 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,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868913012] [2025-01-09 04:44:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868913012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621267269] [2025-01-09 04:44:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:00,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:00,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:00,846 INFO L87 Difference]: Start difference. First operand has 1102 states, 1094 states have (on average 1.8875685557586837) internal successors, (2065), 1101 states have internal predecessors, (2065), 0 states have call successors, (0), 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 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:01,543 INFO L93 Difference]: Finished difference Result 1790 states and 3275 transitions. [2025-01-09 04:44:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 04:44:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:01,561 INFO L225 Difference]: With dead ends: 1790 [2025-01-09 04:44:01,562 INFO L226 Difference]: Without dead ends: 987 [2025-01-09 04:44:01,568 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:44:01,570 INFO L435 NwaCegarLoop]: 1062 mSDtfsCounter, 5044 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:01,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 1250 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:44:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-01-09 04:44:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 979. [2025-01-09 04:44:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 972 states have (on average 1.3477366255144032) internal successors, (1310), 978 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have 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,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1310 transitions. [2025-01-09 04:44:01,651 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1310 transitions. Word has length 63 [2025-01-09 04:44:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:01,652 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1310 transitions. [2025-01-09 04:44:01,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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,652 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1310 transitions. [2025-01-09 04:44:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:01,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:01,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:01,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:44:01,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:01,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash 517550277, now seen corresponding path program 1 times [2025-01-09 04:44:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755275649] [2025-01-09 04:44:01,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:01,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:01,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:01,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:01,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:01,780 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:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755275649] [2025-01-09 04:44:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755275649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409729849] [2025-01-09 04:44:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:01,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:01,782 INFO L87 Difference]: Start difference. First operand 979 states and 1310 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:44:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:01,829 INFO L93 Difference]: Finished difference Result 1722 states and 2352 transitions. [2025-01-09 04:44:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:01,830 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:44:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:01,834 INFO L225 Difference]: With dead ends: 1722 [2025-01-09 04:44:01,834 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 04:44:01,835 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:01,836 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 896 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 2136 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:44:01,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 2136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 04:44:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1393. [2025-01-09 04:44:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1386 states have (on average 1.3398268398268398) internal successors, (1857), 1392 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have 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,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1857 transitions. [2025-01-09 04:44:01,874 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1857 transitions. Word has length 64 [2025-01-09 04:44:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:01,874 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1857 transitions. [2025-01-09 04:44:01,874 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:44:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1857 transitions. [2025-01-09 04:44:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:01,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:01,877 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:44:01,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:44:01,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:01,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1546123801, 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 [2086826766] [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,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:02,002 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,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086826766] [2025-01-09 04:44:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086826766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393649721] [2025-01-09 04:44:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:02,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:02,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:02,005 INFO L87 Difference]: Start difference. First operand 1393 states and 1857 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:44:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:02,090 INFO L93 Difference]: Finished difference Result 2185 states and 3029 transitions. [2025-01-09 04:44:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:02,090 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:44:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:02,096 INFO L225 Difference]: With dead ends: 2185 [2025-01-09 04:44:02,096 INFO L226 Difference]: Without dead ends: 1800 [2025-01-09 04:44:02,097 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:02,097 INFO L435 NwaCegarLoop]: 1156 mSDtfsCounter, 532 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:02,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1864 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-01-09 04:44:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1792. [2025-01-09 04:44:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1785 states have (on average 1.3647058823529412) internal successors, (2436), 1791 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have 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:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2436 transitions. [2025-01-09 04:44:02,129 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2436 transitions. Word has length 64 [2025-01-09 04:44:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:02,129 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2436 transitions. [2025-01-09 04:44:02,129 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:44:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2436 transitions. [2025-01-09 04:44:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:02,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:02,132 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:44:02,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:44:02,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1930220714, now seen corresponding path program 1 times [2025-01-09 04:44:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423372342] [2025-01-09 04:44:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:02,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:02,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:02,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:02,204 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,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423372342] [2025-01-09 04:44:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423372342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476001755] [2025-01-09 04:44:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:02,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:02,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:02,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:02,205 INFO L87 Difference]: Start difference. First operand 1792 states and 2436 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:44:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:02,261 INFO L93 Difference]: Finished difference Result 3258 states and 4588 transitions. [2025-01-09 04:44:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:02,262 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:44:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:02,270 INFO L225 Difference]: With dead ends: 3258 [2025-01-09 04:44:02,270 INFO L226 Difference]: Without dead ends: 2458 [2025-01-09 04:44:02,272 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:02,272 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 553 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:02,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1797 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2025-01-09 04:44:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2450. [2025-01-09 04:44:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2443 states have (on average 1.3835448219402373) internal successors, (3380), 2449 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have 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:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3380 transitions. [2025-01-09 04:44:02,348 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3380 transitions. Word has length 64 [2025-01-09 04:44:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:02,349 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3380 transitions. [2025-01-09 04:44:02,349 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:44:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3380 transitions. [2025-01-09 04:44:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:02,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:02,352 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:44:02,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:44:02,352 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:44:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1847708861, now seen corresponding path program 1 times [2025-01-09 04:44:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:02,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758339621] [2025-01-09 04:44:02,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:02,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:02,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:02,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:02,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:02,502 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,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758339621] [2025-01-09 04:44:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758339621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:02,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495854745] [2025-01-09 04:44:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:02,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:02,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:02,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:02,503 INFO L87 Difference]: Start difference. First operand 2450 states and 3380 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:44:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:02,970 INFO L93 Difference]: Finished difference Result 4663 states and 6528 transitions. [2025-01-09 04:44:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:02,971 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:44:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:02,979 INFO L225 Difference]: With dead ends: 4663 [2025-01-09 04:44:02,979 INFO L226 Difference]: Without dead ends: 2817 [2025-01-09 04:44:02,982 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:44:02,982 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 3048 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:02,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 692 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-01-09 04:44:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2803. [2025-01-09 04:44:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2803 states, 2796 states have (on average 1.3776824034334765) internal successors, (3852), 2802 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have 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,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3852 transitions. [2025-01-09 04:44:03,035 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3852 transitions. Word has length 64 [2025-01-09 04:44:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 2803 states and 3852 transitions. [2025-01-09 04:44:03,035 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:44:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3852 transitions. [2025-01-09 04:44:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:03,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:03,039 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:44:03,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:44:03,039 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:44:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1685345629, now seen corresponding path program 1 times [2025-01-09 04:44:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:03,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430339857] [2025-01-09 04:44:03,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:03,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:03,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:03,157 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:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430339857] [2025-01-09 04:44:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430339857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619609849] [2025-01-09 04:44:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:03,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:03,158 INFO L87 Difference]: Start difference. First operand 2803 states and 3852 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:44:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:03,534 INFO L93 Difference]: Finished difference Result 6625 states and 9341 transitions. [2025-01-09 04:44:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:03,534 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:44:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:03,547 INFO L225 Difference]: With dead ends: 6625 [2025-01-09 04:44:03,547 INFO L226 Difference]: Without dead ends: 4111 [2025-01-09 04:44:03,549 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:44:03,551 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2711 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:03,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 644 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2025-01-09 04:44:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4103. [2025-01-09 04:44:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4103 states, 4096 states have (on average 1.41162109375) internal successors, (5782), 4102 states have internal predecessors, (5782), 0 states have call successors, (0), 0 states have 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,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 5782 transitions. [2025-01-09 04:44:03,635 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 5782 transitions. Word has length 64 [2025-01-09 04:44:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:03,636 INFO L471 AbstractCegarLoop]: Abstraction has 4103 states and 5782 transitions. [2025-01-09 04:44:03,636 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:44:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5782 transitions. [2025-01-09 04:44:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:44:03,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:03,640 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:44:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:44:03,640 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:44:03,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1051430303, now seen corresponding path program 1 times [2025-01-09 04:44:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762502976] [2025-01-09 04:44:03,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:03,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:44:03,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:44:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762502976] [2025-01-09 04:44:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762502976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22464698] [2025-01-09 04:44:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:03,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:03,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:03,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:03,732 INFO L87 Difference]: Start difference. First operand 4103 states and 5782 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:44:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:03,786 INFO L93 Difference]: Finished difference Result 8762 states and 12471 transitions. [2025-01-09 04:44:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:03,787 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:44:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:03,803 INFO L225 Difference]: With dead ends: 8762 [2025-01-09 04:44:03,804 INFO L226 Difference]: Without dead ends: 5676 [2025-01-09 04:44:03,808 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:03,809 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 583 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1523 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:44:03,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1523 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2025-01-09 04:44:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5650. [2025-01-09 04:44:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5650 states, 5643 states have (on average 1.3891547049441786) internal successors, (7839), 5649 states have internal predecessors, (7839), 0 states have call successors, (0), 0 states have 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,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 7839 transitions. [2025-01-09 04:44:03,909 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 7839 transitions. Word has length 65 [2025-01-09 04:44:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 5650 states and 7839 transitions. [2025-01-09 04:44:03,910 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:44:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 7839 transitions. [2025-01-09 04:44:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:03,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:03,915 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:44:03,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:44:03,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1899148000, now seen corresponding path program 1 times [2025-01-09 04:44:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38220901] [2025-01-09 04:44:03,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:03,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:03,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:04,043 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,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38220901] [2025-01-09 04:44:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38220901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767063241] [2025-01-09 04:44:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:04,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:04,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:04,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:04,044 INFO L87 Difference]: Start difference. First operand 5650 states and 7839 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:44:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:04,381 INFO L93 Difference]: Finished difference Result 12666 states and 17736 transitions. [2025-01-09 04:44:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:44:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:04,411 INFO L225 Difference]: With dead ends: 12666 [2025-01-09 04:44:04,414 INFO L226 Difference]: Without dead ends: 7452 [2025-01-09 04:44:04,421 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:44:04,421 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 2375 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 577 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-01-09 04:44:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7417. [2025-01-09 04:44:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7417 states, 7410 states have (on average 1.3913630229419702) internal successors, (10310), 7416 states have internal predecessors, (10310), 0 states have call successors, (0), 0 states have 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,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7417 states to 7417 states and 10310 transitions. [2025-01-09 04:44:04,554 INFO L78 Accepts]: Start accepts. Automaton has 7417 states and 10310 transitions. Word has length 66 [2025-01-09 04:44:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 7417 states and 10310 transitions. [2025-01-09 04:44:04,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:44:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7417 states and 10310 transitions. [2025-01-09 04:44:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:44:04,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:04,560 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:44:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:44:04,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1449474395, now seen corresponding path program 1 times [2025-01-09 04:44:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811488318] [2025-01-09 04:44:04,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:04,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:44:04,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:44:04,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:04,714 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,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811488318] [2025-01-09 04:44:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811488318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333555758] [2025-01-09 04:44:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:04,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:04,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:04,717 INFO L87 Difference]: Start difference. First operand 7417 states and 10310 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:05,176 INFO L93 Difference]: Finished difference Result 15575 states and 21940 transitions. [2025-01-09 04:44:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:05,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:05,196 INFO L225 Difference]: With dead ends: 15575 [2025-01-09 04:44:05,196 INFO L226 Difference]: Without dead ends: 12030 [2025-01-09 04:44:05,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:05,205 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2861 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:05,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 1054 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12030 states. [2025-01-09 04:44:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12030 to 7445. [2025-01-09 04:44:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7445 states, 7438 states have (on average 1.3909653132562516) internal successors, (10346), 7444 states have internal predecessors, (10346), 0 states have call successors, (0), 0 states have 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,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 10346 transitions. [2025-01-09 04:44:05,351 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 10346 transitions. Word has length 67 [2025-01-09 04:44:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:05,351 INFO L471 AbstractCegarLoop]: Abstraction has 7445 states and 10346 transitions. [2025-01-09 04:44:05,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 10346 transitions. [2025-01-09 04:44:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:44:05,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:05,357 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:44:05,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:44:05,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:05,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1861181409, now seen corresponding path program 1 times [2025-01-09 04:44:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250464103] [2025-01-09 04:44:05,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:05,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:44:05,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:44:05,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:05,489 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,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250464103] [2025-01-09 04:44:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250464103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:05,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:05,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609889752] [2025-01-09 04:44:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:05,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:05,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:05,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:05,490 INFO L87 Difference]: Start difference. First operand 7445 states and 10346 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:06,041 INFO L93 Difference]: Finished difference Result 17215 states and 24295 transitions. [2025-01-09 04:44:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:06,062 INFO L225 Difference]: With dead ends: 17215 [2025-01-09 04:44:06,062 INFO L226 Difference]: Without dead ends: 14118 [2025-01-09 04:44:06,070 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:44:06,071 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 3032 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3032 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:06,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3032 Valid, 1079 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:44:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14118 states. [2025-01-09 04:44:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14118 to 7516. [2025-01-09 04:44:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7516 states, 7509 states have (on average 1.390997469703023) internal successors, (10445), 7515 states have internal predecessors, (10445), 0 states have call successors, (0), 0 states have 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 10445 transitions. [2025-01-09 04:44:06,223 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 10445 transitions. Word has length 67 [2025-01-09 04:44:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 7516 states and 10445 transitions. [2025-01-09 04:44:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 10445 transitions. [2025-01-09 04:44:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:44:06,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:06,229 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:44:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:44:06,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2008504829, now seen corresponding path program 1 times [2025-01-09 04:44:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561564391] [2025-01-09 04:44:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:44:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:44:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:06,359 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,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561564391] [2025-01-09 04:44:06,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561564391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949109763] [2025-01-09 04:44:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:06,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:06,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:06,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:06,361 INFO L87 Difference]: Start difference. First operand 7516 states and 10445 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:06,849 INFO L93 Difference]: Finished difference Result 21306 states and 30196 transitions. [2025-01-09 04:44:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:06,875 INFO L225 Difference]: With dead ends: 21306 [2025-01-09 04:44:06,875 INFO L226 Difference]: Without dead ends: 17763 [2025-01-09 04:44:06,882 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:44:06,882 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 3205 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:06,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3205 Valid, 1116 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17763 states. [2025-01-09 04:44:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17763 to 7584. [2025-01-09 04:44:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7577 states have (on average 1.3901280190048833) internal successors, (10533), 7583 states have internal predecessors, (10533), 0 states have call successors, (0), 0 states have 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,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 10533 transitions. [2025-01-09 04:44:07,065 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 10533 transitions. Word has length 67 [2025-01-09 04:44:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,065 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 10533 transitions. [2025-01-09 04:44:07,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 10533 transitions. [2025-01-09 04:44:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:44:07,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,071 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:44:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:44:07,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 296799215, now seen corresponding path program 1 times [2025-01-09 04:44:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748224370] [2025-01-09 04:44:07,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:44:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:44:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:07,236 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,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748224370] [2025-01-09 04:44:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748224370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588367174] [2025-01-09 04:44:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:07,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:07,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:07,238 INFO L87 Difference]: Start difference. First operand 7584 states and 10533 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,806 INFO L93 Difference]: Finished difference Result 19404 states and 27435 transitions. [2025-01-09 04:44:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,829 INFO L225 Difference]: With dead ends: 19404 [2025-01-09 04:44:07,829 INFO L226 Difference]: Without dead ends: 16043 [2025-01-09 04:44:07,837 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:44:07,837 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 3109 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3109 Valid, 1098 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:44:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16043 states. [2025-01-09 04:44:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16043 to 7713. [2025-01-09 04:44:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7713 states, 7706 states have (on average 1.3890474954580847) internal successors, (10704), 7712 states have internal predecessors, (10704), 0 states have call successors, (0), 0 states have 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,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7713 states to 7713 states and 10704 transitions. [2025-01-09 04:44:07,956 INFO L78 Accepts]: Start accepts. Automaton has 7713 states and 10704 transitions. Word has length 67 [2025-01-09 04:44:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,956 INFO L471 AbstractCegarLoop]: Abstraction has 7713 states and 10704 transitions. [2025-01-09 04:44:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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:44:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7713 states and 10704 transitions. [2025-01-09 04:44:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:07,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,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] [2025-01-09 04:44:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:44:07,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -766843701, now seen corresponding path program 1 times [2025-01-09 04:44:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579799921] [2025-01-09 04:44:07,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:08,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:08,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:08,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:08,263 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,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579799921] [2025-01-09 04:44:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579799921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:44:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760695437] [2025-01-09 04:44:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:08,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:08,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:08,265 INFO L87 Difference]: Start difference. First operand 7713 states and 10704 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:08,887 INFO L93 Difference]: Finished difference Result 16122 states and 22766 transitions. [2025-01-09 04:44:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:44:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:08,902 INFO L225 Difference]: With dead ends: 16122 [2025-01-09 04:44:08,902 INFO L226 Difference]: Without dead ends: 11483 [2025-01-09 04:44:08,908 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:08,908 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 3466 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3466 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3466 Valid, 1823 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:44:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2025-01-09 04:44:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 7704. [2025-01-09 04:44:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7704 states, 7697 states have (on average 1.3883331167987527) internal successors, (10686), 7703 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have 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,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 10686 transitions. [2025-01-09 04:44:09,004 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 10686 transitions. Word has length 68 [2025-01-09 04:44:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:09,004 INFO L471 AbstractCegarLoop]: Abstraction has 7704 states and 10686 transitions. [2025-01-09 04:44:09,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 10686 transitions. [2025-01-09 04:44:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:09,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:09,010 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:44:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:44:09,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:09,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -646757943, now seen corresponding path program 1 times [2025-01-09 04:44:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998626312] [2025-01-09 04:44:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:09,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:09,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:09,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:09,300 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,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998626312] [2025-01-09 04:44:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998626312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:44:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653211155] [2025-01-09 04:44:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:09,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:09,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:09,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:09,302 INFO L87 Difference]: Start difference. First operand 7704 states and 10686 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:09,929 INFO L93 Difference]: Finished difference Result 16268 states and 22983 transitions. [2025-01-09 04:44:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:44:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:09,945 INFO L225 Difference]: With dead ends: 16268 [2025-01-09 04:44:09,945 INFO L226 Difference]: Without dead ends: 11599 [2025-01-09 04:44:09,952 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:09,952 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 3545 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3545 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:09,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3545 Valid, 1771 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:44:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11599 states. [2025-01-09 04:44:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11599 to 7680. [2025-01-09 04:44:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7680 states, 7673 states have (on average 1.387592858073765) internal successors, (10647), 7679 states have internal predecessors, (10647), 0 states have call successors, (0), 0 states have 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7680 states to 7680 states and 10647 transitions. [2025-01-09 04:44:10,056 INFO L78 Accepts]: Start accepts. Automaton has 7680 states and 10647 transitions. Word has length 68 [2025-01-09 04:44:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:10,056 INFO L471 AbstractCegarLoop]: Abstraction has 7680 states and 10647 transitions. [2025-01-09 04:44:10,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7680 states and 10647 transitions. [2025-01-09 04:44:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:10,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:10,061 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:44:10,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:44:10,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 850267752, now seen corresponding path program 1 times [2025-01-09 04:44:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843437930] [2025-01-09 04:44:10,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:10,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:10,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:10,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:10,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:10,181 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,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843437930] [2025-01-09 04:44:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843437930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154241088] [2025-01-09 04:44:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:10,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:10,182 INFO L87 Difference]: Start difference. First operand 7680 states and 10647 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:44:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:10,744 INFO L93 Difference]: Finished difference Result 17433 states and 24571 transitions. [2025-01-09 04:44:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:10,744 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:44:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:10,761 INFO L225 Difference]: With dead ends: 17433 [2025-01-09 04:44:10,762 INFO L226 Difference]: Without dead ends: 14336 [2025-01-09 04:44:10,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:10,769 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 3020 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:10,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 1079 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:44:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14336 states. [2025-01-09 04:44:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14336 to 7749. [2025-01-09 04:44:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7749 states, 7742 states have (on average 1.3877551020408163) internal successors, (10744), 7748 states have internal predecessors, (10744), 0 states have call successors, (0), 0 states have 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,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 10744 transitions. [2025-01-09 04:44:10,885 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 10744 transitions. Word has length 68 [2025-01-09 04:44:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 7749 states and 10744 transitions. [2025-01-09 04:44:10,885 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:44:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 10744 transitions. [2025-01-09 04:44:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:10,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:10,889 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:44:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:44:10,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -16939312, now seen corresponding path program 1 times [2025-01-09 04:44:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359017142] [2025-01-09 04:44:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:10,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:10,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:11,124 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,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359017142] [2025-01-09 04:44:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359017142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:44:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692403852] [2025-01-09 04:44:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:11,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:11,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:11,126 INFO L87 Difference]: Start difference. First operand 7749 states and 10744 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:11,878 INFO L93 Difference]: Finished difference Result 16425 states and 23195 transitions. [2025-01-09 04:44:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:44:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:11,903 INFO L225 Difference]: With dead ends: 16425 [2025-01-09 04:44:11,903 INFO L226 Difference]: Without dead ends: 11532 [2025-01-09 04:44:11,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:44:11,911 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 3096 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:11,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 2061 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:44:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11532 states. [2025-01-09 04:44:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11532 to 7614. [2025-01-09 04:44:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7614 states, 7607 states have (on average 1.387537794136979) internal successors, (10555), 7613 states have internal predecessors, (10555), 0 states have call successors, (0), 0 states have 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 10555 transitions. [2025-01-09 04:44:12,057 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 10555 transitions. Word has length 68 [2025-01-09 04:44:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 7614 states and 10555 transitions. [2025-01-09 04:44:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 10555 transitions. [2025-01-09 04:44:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:12,071 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:44:12,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:44:12,071 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:12,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1623797592, now seen corresponding path program 1 times [2025-01-09 04:44:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463861048] [2025-01-09 04:44:12,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:12,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:12,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:12,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:12,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:12,526 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,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463861048] [2025-01-09 04:44:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463861048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:44:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245863939] [2025-01-09 04:44:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:44:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:12,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:44:12,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:44:12,528 INFO L87 Difference]: Start difference. First operand 7614 states and 10555 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:13,271 INFO L93 Difference]: Finished difference Result 15998 states and 22620 transitions. [2025-01-09 04:44:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:44:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:13,284 INFO L225 Difference]: With dead ends: 15998 [2025-01-09 04:44:13,284 INFO L226 Difference]: Without dead ends: 10605 [2025-01-09 04:44:13,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:44:13,293 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 2809 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2809 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:13,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2809 Valid, 1558 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:44:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2025-01-09 04:44:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7287. [2025-01-09 04:44:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 7280 states have (on average 1.3862637362637362) internal successors, (10092), 7286 states have internal predecessors, (10092), 0 states have call successors, (0), 0 states have 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,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 10092 transitions. [2025-01-09 04:44:13,410 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 10092 transitions. Word has length 68 [2025-01-09 04:44:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 10092 transitions. [2025-01-09 04:44:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 10092 transitions. [2025-01-09 04:44:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:13,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:13,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:44:13,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 601134174, now seen corresponding path program 1 times [2025-01-09 04:44:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897488497] [2025-01-09 04:44:13,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:13,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:13,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:14,169 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:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897488497] [2025-01-09 04:44:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897488497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:44:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699129342] [2025-01-09 04:44:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:14,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:44:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:44:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:14,171 INFO L87 Difference]: Start difference. First operand 7287 states and 10092 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:14,848 INFO L93 Difference]: Finished difference Result 17084 states and 24263 transitions. [2025-01-09 04:44:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:14,859 INFO L225 Difference]: With dead ends: 17084 [2025-01-09 04:44:14,859 INFO L226 Difference]: Without dead ends: 12156 [2025-01-09 04:44:14,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:44:14,865 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 3817 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3817 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:14,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3817 Valid, 2769 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12156 states. [2025-01-09 04:44:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12156 to 6954. [2025-01-09 04:44:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6949 states have (on average 1.3889768311987336) internal successors, (9652), 6953 states have internal predecessors, (9652), 0 states have call successors, (0), 0 states have 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:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 9652 transitions. [2025-01-09 04:44:14,941 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 9652 transitions. Word has length 69 [2025-01-09 04:44:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 6954 states and 9652 transitions. [2025-01-09 04:44:14,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 9652 transitions. [2025-01-09 04:44:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:14,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:14,945 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:14,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:44:14,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -10442599, now seen corresponding path program 1 times [2025-01-09 04:44:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655103356] [2025-01-09 04:44:14,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:14,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:14,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:14,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:14,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:15,350 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,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655103356] [2025-01-09 04:44:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655103356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:15,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:44:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071719197] [2025-01-09 04:44:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:15,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:44:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:15,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:44:15,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:15,351 INFO L87 Difference]: Start difference. First operand 6954 states and 9652 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:16,399 INFO L93 Difference]: Finished difference Result 23136 states and 33029 transitions. [2025-01-09 04:44:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:16,417 INFO L225 Difference]: With dead ends: 23136 [2025-01-09 04:44:16,417 INFO L226 Difference]: Without dead ends: 18243 [2025-01-09 04:44:16,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:44:16,427 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 3723 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3723 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:16,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3723 Valid, 2726 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:44:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-01-09 04:44:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 6706. [2025-01-09 04:44:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6702 states have (on average 1.3866010146225007) internal successors, (9293), 6705 states have internal predecessors, (9293), 0 states have call successors, (0), 0 states have 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,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 9293 transitions. [2025-01-09 04:44:16,522 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 9293 transitions. Word has length 69 [2025-01-09 04:44:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 6706 states and 9293 transitions. [2025-01-09 04:44:16,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 9293 transitions. [2025-01-09 04:44:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:16,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:16,525 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:16,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:44:16,525 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:16,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1218623503, now seen corresponding path program 1 times [2025-01-09 04:44:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872354570] [2025-01-09 04:44:16,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:16,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,120 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:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872354570] [2025-01-09 04:44:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872354570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:44:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333818596] [2025-01-09 04:44:17,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:44:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:44:17,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:17,121 INFO L87 Difference]: Start difference. First operand 6706 states and 9293 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,825 INFO L93 Difference]: Finished difference Result 16255 states and 23115 transitions. [2025-01-09 04:44:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:17,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,838 INFO L225 Difference]: With dead ends: 16255 [2025-01-09 04:44:17,838 INFO L226 Difference]: Without dead ends: 11622 [2025-01-09 04:44:17,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:44:17,844 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 3317 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3317 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3317 Valid, 2818 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11622 states. [2025-01-09 04:44:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11622 to 6692. [2025-01-09 04:44:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6692 states, 6689 states have (on average 1.3855583794289132) internal successors, (9268), 6691 states have internal predecessors, (9268), 0 states have call successors, (0), 0 states have 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,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6692 states to 6692 states and 9268 transitions. [2025-01-09 04:44:17,922 INFO L78 Accepts]: Start accepts. Automaton has 6692 states and 9268 transitions. Word has length 69 [2025-01-09 04:44:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,922 INFO L471 AbstractCegarLoop]: Abstraction has 6692 states and 9268 transitions. [2025-01-09 04:44:17,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6692 states and 9268 transitions. [2025-01-09 04:44:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:44:17,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:44:17,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 04:44:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1003005764, now seen corresponding path program 1 times [2025-01-09 04:44:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992683603] [2025-01-09 04:44:17,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:44:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:44:17,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,986 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:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992683603] [2025-01-09 04:44:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992683603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436148892] [2025-01-09 04:44:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:17,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:17,987 INFO L87 Difference]: Start difference. First operand 6692 states and 9268 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,184 INFO L93 Difference]: Finished difference Result 13560 states and 19050 transitions. [2025-01-09 04:44:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:18,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:44:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,192 INFO L225 Difference]: With dead ends: 13560 [2025-01-09 04:44:18,193 INFO L226 Difference]: Without dead ends: 9444 [2025-01-09 04:44:18,196 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:18,197 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 379 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 523 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:18,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 523 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9444 states. [2025-01-09 04:44:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9444 to 9415. [2025-01-09 04:44:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9415 states, 9414 states have (on average 1.4108774166135543) internal successors, (13282), 9414 states have internal predecessors, (13282), 0 states have call successors, (0), 0 states have 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:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 13282 transitions. [2025-01-09 04:44:18,289 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 13282 transitions. Word has length 71 [2025-01-09 04:44:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:18,290 INFO L471 AbstractCegarLoop]: Abstraction has 9415 states and 13282 transitions. [2025-01-09 04:44:18,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 13282 transitions. [2025-01-09 04:44:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:44:18,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:18,300 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] [2025-01-09 04:44:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:44:18,300 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:18,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:18,300 INFO L85 PathProgramCache]: Analyzing trace with hash -485578834, now seen corresponding path program 1 times [2025-01-09 04:44:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441580480] [2025-01-09 04:44:18,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:44:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:44:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:18,385 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:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441580480] [2025-01-09 04:44:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441580480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389814410] [2025-01-09 04:44:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:18,387 INFO L87 Difference]: Start difference. First operand 9415 states and 13282 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,580 INFO L93 Difference]: Finished difference Result 47360 states and 68772 transitions. [2025-01-09 04:44:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-01-09 04:44:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,624 INFO L225 Difference]: With dead ends: 47360 [2025-01-09 04:44:18,625 INFO L226 Difference]: Without dead ends: 39771 [2025-01-09 04:44:18,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:18,643 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2038 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1183 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:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 1183 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:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39771 states. [2025-01-09 04:44:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39771 to 17002. [2025-01-09 04:44:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17002 states, 17001 states have (on average 1.4180930533498028) internal successors, (24109), 17001 states have internal predecessors, (24109), 0 states have call successors, (0), 0 states have 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17002 states to 17002 states and 24109 transitions. [2025-01-09 04:44:19,057 INFO L78 Accepts]: Start accepts. Automaton has 17002 states and 24109 transitions. Word has length 84 [2025-01-09 04:44:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 17002 states and 24109 transitions. [2025-01-09 04:44:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17002 states and 24109 transitions. [2025-01-09 04:44:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:44:19,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,068 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] [2025-01-09 04:44:19,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:44:19,068 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:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1437916483, now seen corresponding path program 1 times [2025-01-09 04:44:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450943865] [2025-01-09 04:44:19,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:44:19,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:44:19,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:19,167 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,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450943865] [2025-01-09 04:44:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450943865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90821422] [2025-01-09 04:44:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:19,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:19,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:19,169 INFO L87 Difference]: Start difference. First operand 17002 states and 24109 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:19,357 INFO L93 Difference]: Finished difference Result 28820 states and 40852 transitions. [2025-01-09 04:44:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 04:44:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:19,381 INFO L225 Difference]: With dead ends: 28820 [2025-01-09 04:44:19,381 INFO L226 Difference]: Without dead ends: 19550 [2025-01-09 04:44:19,392 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:19,393 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 987 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:19,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1384 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19550 states. [2025-01-09 04:44:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19550 to 14426. [2025-01-09 04:44:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14426 states, 14425 states have (on average 1.3984055459272098) internal successors, (20172), 14425 states have internal predecessors, (20172), 0 states have call successors, (0), 0 states have 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,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14426 states to 14426 states and 20172 transitions. [2025-01-09 04:44:19,683 INFO L78 Accepts]: Start accepts. Automaton has 14426 states and 20172 transitions. Word has length 85 [2025-01-09 04:44:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 14426 states and 20172 transitions. [2025-01-09 04:44:19,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14426 states and 20172 transitions. [2025-01-09 04:44:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:19,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,695 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:19,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:44:19,696 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:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1391083626, now seen corresponding path program 1 times [2025-01-09 04:44:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259084027] [2025-01-09 04:44:19,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:19,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:19,763 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,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259084027] [2025-01-09 04:44:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259084027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134159945] [2025-01-09 04:44:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:19,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:19,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:19,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:19,765 INFO L87 Difference]: Start difference. First operand 14426 states and 20172 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:19,815 INFO L93 Difference]: Finished difference Result 21716 states and 30418 transitions. [2025-01-09 04:44:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 04:44:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:19,828 INFO L225 Difference]: With dead ends: 21716 [2025-01-09 04:44:19,828 INFO L226 Difference]: Without dead ends: 12940 [2025-01-09 04:44:19,836 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:19,836 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 250 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 937 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:19,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 937 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:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2025-01-09 04:44:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 12938. [2025-01-09 04:44:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12938 states, 12937 states have (on average 1.3847105202133416) internal successors, (17914), 12937 states have internal predecessors, (17914), 0 states have call successors, (0), 0 states have 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,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12938 states to 12938 states and 17914 transitions. [2025-01-09 04:44:19,957 INFO L78 Accepts]: Start accepts. Automaton has 12938 states and 17914 transitions. Word has length 86 [2025-01-09 04:44:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 12938 states and 17914 transitions. [2025-01-09 04:44:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12938 states and 17914 transitions. [2025-01-09 04:44:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:44:19,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:44:19,966 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:19,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash -214737700, now seen corresponding path program 1 times [2025-01-09 04:44:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739697390] [2025-01-09 04:44:19,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:44:19,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:44:19,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:20,097 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:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739697390] [2025-01-09 04:44:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739697390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064537010] [2025-01-09 04:44:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:20,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:20,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:20,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:20,098 INFO L87 Difference]: Start difference. First operand 12938 states and 17914 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,172 INFO L93 Difference]: Finished difference Result 34794 states and 48696 transitions. [2025-01-09 04:44:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:20,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 04:44:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,194 INFO L225 Difference]: With dead ends: 34794 [2025-01-09 04:44:20,195 INFO L226 Difference]: Without dead ends: 23516 [2025-01-09 04:44:20,207 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:20,207 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 142 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:20,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 856 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23516 states. [2025-01-09 04:44:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23516 to 22082. [2025-01-09 04:44:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22082 states, 22081 states have (on average 1.38580680222816) internal successors, (30600), 22081 states have internal predecessors, (30600), 0 states have call successors, (0), 0 states have 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,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22082 states to 22082 states and 30600 transitions. [2025-01-09 04:44:20,436 INFO L78 Accepts]: Start accepts. Automaton has 22082 states and 30600 transitions. Word has length 86 [2025-01-09 04:44:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:20,436 INFO L471 AbstractCegarLoop]: Abstraction has 22082 states and 30600 transitions. [2025-01-09 04:44:20,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22082 states and 30600 transitions. [2025-01-09 04:44:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:44:20,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:20,444 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:20,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:44:20,444 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:20,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 181438720, now seen corresponding path program 1 times [2025-01-09 04:44:20,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:20,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957479481] [2025-01-09 04:44:20,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:20,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:44:20,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:44:20,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:20,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:20,488 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:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957479481] [2025-01-09 04:44:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957479481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:20,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:20,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917658422] [2025-01-09 04:44:20,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:20,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:20,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:20,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:20,490 INFO L87 Difference]: Start difference. First operand 22082 states and 30600 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,555 INFO L93 Difference]: Finished difference Result 30609 states and 42473 transitions. [2025-01-09 04:44:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:44:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,576 INFO L225 Difference]: With dead ends: 30609 [2025-01-09 04:44:20,577 INFO L226 Difference]: Without dead ends: 18076 [2025-01-09 04:44:20,589 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:20,590 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 241 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 938 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:20,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 938 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:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18076 states. [2025-01-09 04:44:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18076 to 18074. [2025-01-09 04:44:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18074 states, 18073 states have (on average 1.3756432246998285) internal successors, (24862), 18073 states have internal predecessors, (24862), 0 states have call successors, (0), 0 states have 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,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18074 states to 18074 states and 24862 transitions. [2025-01-09 04:44:20,751 INFO L78 Accepts]: Start accepts. Automaton has 18074 states and 24862 transitions. Word has length 87 [2025-01-09 04:44:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:20,751 INFO L471 AbstractCegarLoop]: Abstraction has 18074 states and 24862 transitions. [2025-01-09 04:44:20,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18074 states and 24862 transitions. [2025-01-09 04:44:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:44:20,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:20,758 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:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:44:20,759 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:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1393258625, now seen corresponding path program 1 times [2025-01-09 04:44:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347814037] [2025-01-09 04:44:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:44:20,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:44:20,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:20,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:20,840 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:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347814037] [2025-01-09 04:44:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347814037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780128936] [2025-01-09 04:44:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:20,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:20,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:20,841 INFO L87 Difference]: Start difference. First operand 18074 states and 24862 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,956 INFO L93 Difference]: Finished difference Result 49898 states and 69036 transitions. [2025-01-09 04:44:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:44:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,991 INFO L225 Difference]: With dead ends: 49898 [2025-01-09 04:44:20,991 INFO L226 Difference]: Without dead ends: 33436 [2025-01-09 04:44:21,009 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:21,012 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 129 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 838 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:21,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 838 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:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33436 states. [2025-01-09 04:44:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33436 to 31218. [2025-01-09 04:44:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31218 states, 31217 states have (on average 1.3693179998077971) internal successors, (42746), 31217 states have internal predecessors, (42746), 0 states have call successors, (0), 0 states have 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:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31218 states to 31218 states and 42746 transitions. [2025-01-09 04:44:21,359 INFO L78 Accepts]: Start accepts. Automaton has 31218 states and 42746 transitions. Word has length 87 [2025-01-09 04:44:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:21,360 INFO L471 AbstractCegarLoop]: Abstraction has 31218 states and 42746 transitions. [2025-01-09 04:44:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31218 states and 42746 transitions. [2025-01-09 04:44:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:44:21,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:21,366 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:21,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:44:21,367 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:21,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -746388302, now seen corresponding path program 1 times [2025-01-09 04:44:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935846651] [2025-01-09 04:44:21,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:44:21,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:44:21,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:21,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:21,427 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:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935846651] [2025-01-09 04:44:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935846651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036059839] [2025-01-09 04:44:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:21,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:21,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:21,428 INFO L87 Difference]: Start difference. First operand 31218 states and 42746 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:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:21,519 INFO L93 Difference]: Finished difference Result 38182 states and 52354 transitions. [2025-01-09 04:44:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:21,519 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:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:21,551 INFO L225 Difference]: With dead ends: 38182 [2025-01-09 04:44:21,552 INFO L226 Difference]: Without dead ends: 25577 [2025-01-09 04:44:21,566 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:21,566 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 198 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 882 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:21,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 882 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25577 states. [2025-01-09 04:44:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25577 to 25575. [2025-01-09 04:44:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25575 states, 25574 states have (on average 1.3667787596777978) internal successors, (34954), 25574 states have internal predecessors, (34954), 0 states have call successors, (0), 0 states have 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:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25575 states to 25575 states and 34954 transitions. [2025-01-09 04:44:21,995 INFO L78 Accepts]: Start accepts. Automaton has 25575 states and 34954 transitions. Word has length 88 [2025-01-09 04:44:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 25575 states and 34954 transitions. [2025-01-09 04:44:21,995 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:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25575 states and 34954 transitions. [2025-01-09 04:44:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:44:22,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:22,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:44:22,007 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:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -384451911, now seen corresponding path program 1 times [2025-01-09 04:44:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596453689] [2025-01-09 04:44:22,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:22,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:44:22,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:44:22,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:22,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:22,135 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:22,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:22,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596453689] [2025-01-09 04:44:22,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596453689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:22,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:22,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361209575] [2025-01-09 04:44:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:22,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:22,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:22,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:22,136 INFO L87 Difference]: Start difference. First operand 25575 states and 34954 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:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:22,251 INFO L93 Difference]: Finished difference Result 70747 states and 96892 transitions. [2025-01-09 04:44:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:22,252 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:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:22,307 INFO L225 Difference]: With dead ends: 70747 [2025-01-09 04:44:22,307 INFO L226 Difference]: Without dead ends: 46721 [2025-01-09 04:44:22,337 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:22,338 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 151 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 877 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:22,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 877 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:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46721 states. [2025-01-09 04:44:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46721 to 43295. [2025-01-09 04:44:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43295 states, 43294 states have (on average 1.3587564096641567) internal successors, (58826), 43294 states have internal predecessors, (58826), 0 states have call successors, (0), 0 states have 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:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43295 states to 43295 states and 58826 transitions. [2025-01-09 04:44:22,983 INFO L78 Accepts]: Start accepts. Automaton has 43295 states and 58826 transitions. Word has length 89 [2025-01-09 04:44:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:22,983 INFO L471 AbstractCegarLoop]: Abstraction has 43295 states and 58826 transitions. [2025-01-09 04:44:22,983 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:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 43295 states and 58826 transitions. [2025-01-09 04:44:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:44:22,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:22,989 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:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:44:22,989 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:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2033472567, now seen corresponding path program 1 times [2025-01-09 04:44:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052748561] [2025-01-09 04:44:22,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:23,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:44:23,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:44:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:23,087 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,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052748561] [2025-01-09 04:44:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052748561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:23,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533364679] [2025-01-09 04:44:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:23,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:23,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:23,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:23,088 INFO L87 Difference]: Start difference. First operand 43295 states and 58826 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:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:23,557 INFO L93 Difference]: Finished difference Result 123107 states and 167276 transitions. [2025-01-09 04:44:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:23,558 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:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:23,656 INFO L225 Difference]: With dead ends: 123107 [2025-01-09 04:44:23,656 INFO L226 Difference]: Without dead ends: 81361 [2025-01-09 04:44:23,682 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:23,682 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 107 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 831 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 831 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81361 states. [2025-01-09 04:44:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81361 to 75727. [2025-01-09 04:44:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75727 states, 75726 states have (on average 1.3501571454982437) internal successors, (102242), 75726 states have internal predecessors, (102242), 0 states have call successors, (0), 0 states have 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:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75727 states to 75727 states and 102242 transitions. [2025-01-09 04:44:24,603 INFO L78 Accepts]: Start accepts. Automaton has 75727 states and 102242 transitions. Word has length 89 [2025-01-09 04:44:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:24,603 INFO L471 AbstractCegarLoop]: Abstraction has 75727 states and 102242 transitions. [2025-01-09 04:44:24,603 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:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 75727 states and 102242 transitions. [2025-01-09 04:44:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:44:24,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:24,608 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:24,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:44:24,608 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:24,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1745220661, now seen corresponding path program 1 times [2025-01-09 04:44:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:24,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991529733] [2025-01-09 04:44:24,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:24,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:44:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:44:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:25,107 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:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:25,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991529733] [2025-01-09 04:44:25,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991529733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:25,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:25,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616474401] [2025-01-09 04:44:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:25,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:25,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:25,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:25,109 INFO L87 Difference]: Start difference. First operand 75727 states and 102242 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:25,475 INFO L93 Difference]: Finished difference Result 81969 states and 110563 transitions. [2025-01-09 04:44:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:25,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:25,579 INFO L225 Difference]: With dead ends: 81969 [2025-01-09 04:44:25,579 INFO L226 Difference]: Without dead ends: 81967 [2025-01-09 04:44:25,606 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:25,606 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 0 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:25,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2090 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81967 states. [2025-01-09 04:44:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81967 to 81967. [2025-01-09 04:44:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81967 states, 81966 states have (on average 1.3234999877998195) internal successors, (108482), 81966 states have internal predecessors, (108482), 0 states have call successors, (0), 0 states have 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,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81967 states to 81967 states and 108482 transitions. [2025-01-09 04:44:26,512 INFO L78 Accepts]: Start accepts. Automaton has 81967 states and 108482 transitions. Word has length 91 [2025-01-09 04:44:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 81967 states and 108482 transitions. [2025-01-09 04:44:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 81967 states and 108482 transitions. [2025-01-09 04:44:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:44:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:26,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:44:26,517 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:26,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1316288567, now seen corresponding path program 1 times [2025-01-09 04:44:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447271523] [2025-01-09 04:44:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:26,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:44:26,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:44:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:26,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:44:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447271523] [2025-01-09 04:44:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447271523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018344530] [2025-01-09 04:44:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:26,572 INFO L87 Difference]: Start difference. First operand 81967 states and 108482 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:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:27,265 INFO L93 Difference]: Finished difference Result 204699 states and 270620 transitions. [2025-01-09 04:44:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:27,265 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:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:27,402 INFO L225 Difference]: With dead ends: 204699 [2025-01-09 04:44:27,402 INFO L226 Difference]: Without dead ends: 124281 [2025-01-09 04:44:27,444 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:27,445 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 324 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:27,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 574 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124281 states. [2025-01-09 04:44:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124281 to 123239. [2025-01-09 04:44:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123239 states, 123238 states have (on average 1.305003326895925) internal successors, (160826), 123238 states have internal predecessors, (160826), 0 states have call successors, (0), 0 states have 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:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123239 states to 123239 states and 160826 transitions. [2025-01-09 04:44:28,988 INFO L78 Accepts]: Start accepts. Automaton has 123239 states and 160826 transitions. Word has length 92 [2025-01-09 04:44:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:28,988 INFO L471 AbstractCegarLoop]: Abstraction has 123239 states and 160826 transitions. [2025-01-09 04:44:28,988 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:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 123239 states and 160826 transitions. [2025-01-09 04:44:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:44:28,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:28,992 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] [2025-01-09 04:44:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:44:28,992 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:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1895115289, now seen corresponding path program 1 times [2025-01-09 04:44:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029457971] [2025-01-09 04:44:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:29,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:44:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:44:29,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:29,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:29,273 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:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029457971] [2025-01-09 04:44:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029457971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611629297] [2025-01-09 04:44:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:29,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:29,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:29,274 INFO L87 Difference]: Start difference. First operand 123239 states and 160826 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:29,925 INFO L93 Difference]: Finished difference Result 191969 states and 251591 transitions. [2025-01-09 04:44:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:29,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:44:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:30,140 INFO L225 Difference]: With dead ends: 191969 [2025-01-09 04:44:30,141 INFO L226 Difference]: Without dead ends: 165147 [2025-01-09 04:44:30,174 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:30,174 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1570 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:30,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 1328 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165147 states. [2025-01-09 04:44:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165147 to 141571. [2025-01-09 04:44:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141571 states, 141570 states have (on average 1.3026064844246663) internal successors, (184410), 141570 states have internal predecessors, (184410), 0 states have call successors, (0), 0 states have 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:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141571 states to 141571 states and 184410 transitions. [2025-01-09 04:44:32,206 INFO L78 Accepts]: Start accepts. Automaton has 141571 states and 184410 transitions. Word has length 93 [2025-01-09 04:44:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:32,206 INFO L471 AbstractCegarLoop]: Abstraction has 141571 states and 184410 transitions. [2025-01-09 04:44:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 141571 states and 184410 transitions. [2025-01-09 04:44:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:44:32,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:32,210 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:32,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:44:32,210 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:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1090055509, now seen corresponding path program 1 times [2025-01-09 04:44:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651434635] [2025-01-09 04:44:32,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:32,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:44:32,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:44:32,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:32,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:32,247 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:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651434635] [2025-01-09 04:44:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651434635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397279366] [2025-01-09 04:44:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:32,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:32,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:32,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:32,248 INFO L87 Difference]: Start difference. First operand 141571 states and 184410 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:33,149 INFO L93 Difference]: Finished difference Result 280712 states and 365724 transitions. [2025-01-09 04:44:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:33,358 INFO L225 Difference]: With dead ends: 280712 [2025-01-09 04:44:33,358 INFO L226 Difference]: Without dead ends: 199671 [2025-01-09 04:44:33,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:33,393 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 374 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 565 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:33,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 565 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:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199671 states. [2025-01-09 04:44:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199671 to 139179. [2025-01-09 04:44:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139179 states, 139178 states have (on average 1.2999180905028094) internal successors, (180920), 139178 states have internal predecessors, (180920), 0 states have call successors, (0), 0 states have 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:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139179 states to 139179 states and 180920 transitions. [2025-01-09 04:44:35,359 INFO L78 Accepts]: Start accepts. Automaton has 139179 states and 180920 transitions. Word has length 94 [2025-01-09 04:44:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 139179 states and 180920 transitions. [2025-01-09 04:44:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 139179 states and 180920 transitions. [2025-01-09 04:44:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:44:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:35,368 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:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:44:35,369 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:35,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1491463166, now seen corresponding path program 1 times [2025-01-09 04:44:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667507659] [2025-01-09 04:44:35,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:44:35,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:44:35,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:35,514 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:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:35,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667507659] [2025-01-09 04:44:35,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667507659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:35,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492737057] [2025-01-09 04:44:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:35,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:35,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:35,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:35,516 INFO L87 Difference]: Start difference. First operand 139179 states and 180920 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:36,540 INFO L93 Difference]: Finished difference Result 196825 states and 256837 transitions. [2025-01-09 04:44:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:36,767 INFO L225 Difference]: With dead ends: 196825 [2025-01-09 04:44:36,767 INFO L226 Difference]: Without dead ends: 170867 [2025-01-09 04:44:36,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:36,809 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1557 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:36,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1296 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170867 states. [2025-01-09 04:44:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170867 to 157031. [2025-01-09 04:44:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157031 states, 157030 states have (on average 1.2977392854868497) internal successors, (203784), 157030 states have internal predecessors, (203784), 0 states have call successors, (0), 0 states have 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:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157031 states to 157031 states and 203784 transitions. [2025-01-09 04:44:38,914 INFO L78 Accepts]: Start accepts. Automaton has 157031 states and 203784 transitions. Word has length 95 [2025-01-09 04:44:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:38,914 INFO L471 AbstractCegarLoop]: Abstraction has 157031 states and 203784 transitions. [2025-01-09 04:44:38,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 157031 states and 203784 transitions. [2025-01-09 04:44:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:44:38,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:38,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:44:38,935 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,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2126846625, now seen corresponding path program 1 times [2025-01-09 04:44:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575894640] [2025-01-09 04:44:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:38,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575894640] [2025-01-09 04:44:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575894640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983301060] [2025-01-09 04:44:39,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:39,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:39,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:39,263 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:39,264 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:39,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:39,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:39,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:39,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:39,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:44:39,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:44:39,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:44:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983301060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:44:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-01-09 04:44:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531486574] [2025-01-09 04:44:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:44:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:39,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:44:39,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:44:39,955 INFO L87 Difference]: Start difference. First operand 157031 states and 203784 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:41,277 INFO L93 Difference]: Finished difference Result 380325 states and 493326 transitions. [2025-01-09 04:44:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 116 [2025-01-09 04:44:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:41,580 INFO L225 Difference]: With dead ends: 380325 [2025-01-09 04:44:41,580 INFO L226 Difference]: Without dead ends: 224024 [2025-01-09 04:44:41,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:44:41,692 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1702 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:41,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1093 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224024 states. [2025-01-09 04:44:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224024 to 156958. [2025-01-09 04:44:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156958 states, 156957 states have (on average 1.2976929987193946) internal successors, (203682), 156957 states have internal predecessors, (203682), 0 states have call successors, (0), 0 states have 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:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156958 states to 156958 states and 203682 transitions. [2025-01-09 04:44:43,954 INFO L78 Accepts]: Start accepts. Automaton has 156958 states and 203682 transitions. Word has length 116 [2025-01-09 04:44:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:43,954 INFO L471 AbstractCegarLoop]: Abstraction has 156958 states and 203682 transitions. [2025-01-09 04:44:43,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 156958 states and 203682 transitions. [2025-01-09 04:44:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:44:43,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:43,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:43,984 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:44,177 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,SelfDestructingSolverStorable35 [2025-01-09 04:44:44,177 INFO L396 AbstractCegarLoop]: === Iteration 37 === 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:44,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -841881477, now seen corresponding path program 1 times [2025-01-09 04:44:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180393978] [2025-01-09 04:44:44,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:44,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:44,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:44,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:44,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:44,604 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:44,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180393978] [2025-01-09 04:44:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180393978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190048156] [2025-01-09 04:44:44,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:44,607 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:44,608 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:44,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:44,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:44,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:44,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:44:44,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:45,132 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:45,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:44:45,264 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:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190048156] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:44:45,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:44:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:44:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437246971] [2025-01-09 04:44:45,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:44:45,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:44:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:45,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:44:45,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:44:45,267 INFO L87 Difference]: Start difference. First operand 156958 states and 203682 transitions. Second operand has 14 states, 14 states have (on average 22.142857142857142) internal successors, (310), 14 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have 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:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:46,880 INFO L93 Difference]: Finished difference Result 407306 states and 529932 transitions. [2025-01-09 04:44:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:44:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 22.142857142857142) internal successors, (310), 14 states have internal predecessors, (310), 0 states have call successors, (0), 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 116 [2025-01-09 04:44:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:47,185 INFO L225 Difference]: With dead ends: 407306 [2025-01-09 04:44:47,185 INFO L226 Difference]: Without dead ends: 251496 [2025-01-09 04:44:47,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:44:47,230 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 2133 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:47,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 1479 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251496 states. [2025-01-09 04:44:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251496 to 184070. [2025-01-09 04:44:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184070 states, 184069 states have (on average 1.2787487300957794) internal successors, (235378), 184069 states have internal predecessors, (235378), 0 states have call successors, (0), 0 states have 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:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184070 states to 184070 states and 235378 transitions. [2025-01-09 04:44:49,648 INFO L78 Accepts]: Start accepts. Automaton has 184070 states and 235378 transitions. Word has length 116 [2025-01-09 04:44:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:49,648 INFO L471 AbstractCegarLoop]: Abstraction has 184070 states and 235378 transitions. [2025-01-09 04:44:49,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.142857142857142) internal successors, (310), 14 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have 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:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 184070 states and 235378 transitions. [2025-01-09 04:44:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:44:49,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:49,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:44:49,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 04:44:49,874 INFO L396 AbstractCegarLoop]: === Iteration 38 === 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:49,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -212715871, now seen corresponding path program 1 times [2025-01-09 04:44:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580110264] [2025-01-09 04:44:49,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:49,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:49,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:49,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:49,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580110264] [2025-01-09 04:44:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580110264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440618621] [2025-01-09 04:44:50,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:50,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:50,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:44:50,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:44:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:44:50,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:44:50,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:50,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:44:50,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:44:50,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:44:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:44:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440618621] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:44:51,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:44:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 19 [2025-01-09 04:44:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429099408] [2025-01-09 04:44:51,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:44:51,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:44:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:44:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:44:51,175 INFO L87 Difference]: Start difference. First operand 184070 states and 235378 transitions. Second operand has 19 states, 19 states have (on average 17.57894736842105) internal successors, (334), 19 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:56,082 INFO L93 Difference]: Finished difference Result 1040680 states and 1333482 transitions. [2025-01-09 04:44:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 04:44:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 17.57894736842105) internal successors, (334), 19 states have internal predecessors, (334), 0 states have call successors, (0), 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 116 [2025-01-09 04:44:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:57,348 INFO L225 Difference]: With dead ends: 1040680 [2025-01-09 04:44:57,348 INFO L226 Difference]: Without dead ends: 857758 [2025-01-09 04:44:57,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=995, Invalid=4261, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 04:44:57,526 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 6189 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6189 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 3594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:57,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6189 Valid, 4086 Invalid, 3594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:44:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857758 states.