./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.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_opt-floodmax.3.3.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 c198beb0d28344ce853798ba0422f36d86e4a319bc1c9073be7222ccddc0e2fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:56:26,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:56:27,077 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:56:27,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:56:27,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:56:27,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:56:27,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:56:27,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:56:27,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:56:27,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:56:27,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:56:27,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:56:27,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:56:27,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:56:27,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:56:27,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:56:27,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:56:27,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:27,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:27,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:27,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:56:27,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:56:27,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:56:27,121 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 -> c198beb0d28344ce853798ba0422f36d86e4a319bc1c9073be7222ccddc0e2fa [2025-01-09 04:56:27,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:56:27,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:56:27,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:56:27,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:56:27,427 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:56:27,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:56:28,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfe9c9a7e/3b47656c1cec407bb51677f230b213f9/FLAG757aa78ba [2025-01-09 04:56:29,107 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:56:29,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:56:29,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfe9c9a7e/3b47656c1cec407bb51677f230b213f9/FLAG757aa78ba [2025-01-09 04:56:29,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfe9c9a7e/3b47656c1cec407bb51677f230b213f9 [2025-01-09 04:56:29,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:56:29,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:56:29,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:29,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:56:29,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:56:29,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7399576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29, skipping insertion in model container [2025-01-09 04:56:29,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:56:29,537 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15595,15608] [2025-01-09 04:56:29,551 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16571,16584] [2025-01-09 04:56:29,617 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28918,28931] [2025-01-09 04:56:29,622 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29565,29578] [2025-01-09 04:56:29,632 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30949,30962] [2025-01-09 04:56:29,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:29,675 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:56:29,758 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15595,15608] [2025-01-09 04:56:29,764 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16571,16584] [2025-01-09 04:56:29,808 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28918,28931] [2025-01-09 04:56:29,812 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29565,29578] [2025-01-09 04:56:29,820 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30949,30962] [2025-01-09 04:56:29,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:29,858 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:56:29,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29 WrapperNode [2025-01-09 04:56:29,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:29,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:29,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:56:29,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:56:29,866 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:56:29" (1/1) ... [2025-01-09 04:56:29,882 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:56:29" (1/1) ... [2025-01-09 04:56:29,937 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1795 [2025-01-09 04:56:29,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:29,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:56:29,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:56:29,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:56:29,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,986 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:56:29,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:29,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:56:30,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:56:30,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:56:30,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:56:30,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (1/1) ... [2025-01-09 04:56:30,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:56:30,113 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:56:30,121 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:56:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:56:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:56:30,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:56:30,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:56:30,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:56:30,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:56:31,750 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 04:56:31,750 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:56:31,781 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:56:31,781 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:56:31,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:31 BoogieIcfgContainer [2025-01-09 04:56:31,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:56:31,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:56:31,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:56:31,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:56:31,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:56:29" (1/3) ... [2025-01-09 04:56:31,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69a1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:31, skipping insertion in model container [2025-01-09 04:56:31,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:29" (2/3) ... [2025-01-09 04:56:31,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69a1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:31, skipping insertion in model container [2025-01-09 04:56:31,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:31" (3/3) ... [2025-01-09 04:56:31,794 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:56:31,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:56:31,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 424 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-01-09 04:56:31,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:56:31,910 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;@7da77808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:56:31,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 04:56:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 04:56:31,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:31,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:31,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1455877833, now seen corresponding path program 1 times [2025-01-09 04:56:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606232552] [2025-01-09 04:56:31,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:32,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:56:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:56:32,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:32,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:32,631 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:56:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606232552] [2025-01-09 04:56:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606232552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:32,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881089086] [2025-01-09 04:56:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:32,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:32,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:32,667 INFO L87 Difference]: Start difference. First operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:32,854 INFO L93 Difference]: Finished difference Result 767 states and 1341 transitions. [2025-01-09 04:56:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:32,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-01-09 04:56:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:32,877 INFO L225 Difference]: With dead ends: 767 [2025-01-09 04:56:32,877 INFO L226 Difference]: Without dead ends: 612 [2025-01-09 04:56:32,883 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:56:32,885 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 474 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1181 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-09 04:56:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2025-01-09 04:56:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 605 states have (on average 1.4793388429752066) internal successors, (895), 609 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2025-01-09 04:56:32,968 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 150 [2025-01-09 04:56:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:32,968 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2025-01-09 04:56:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2025-01-09 04:56:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 04:56:32,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:32,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:56:32,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:32,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1340171657, now seen corresponding path program 1 times [2025-01-09 04:56:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174682305] [2025-01-09 04:56:32,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:56:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:56:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:33,879 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:56:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174682305] [2025-01-09 04:56:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174682305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:33,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085488141] [2025-01-09 04:56:33,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:33,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:33,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:33,886 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,071 INFO L93 Difference]: Finished difference Result 2955 states and 4316 transitions. [2025-01-09 04:56:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-01-09 04:56:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,082 INFO L225 Difference]: With dead ends: 2955 [2025-01-09 04:56:34,083 INFO L226 Difference]: Without dead ends: 2354 [2025-01-09 04:56:34,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:34,088 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 1820 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 2592 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-01-09 04:56:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1156. [2025-01-09 04:56:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.466550825369244) internal successors, (1688), 1155 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1688 transitions. [2025-01-09 04:56:34,162 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1688 transitions. Word has length 150 [2025-01-09 04:56:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,162 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1688 transitions. [2025-01-09 04:56:34,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1688 transitions. [2025-01-09 04:56:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:56:34,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:56:34,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1287913931, now seen corresponding path program 1 times [2025-01-09 04:56:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767961944] [2025-01-09 04:56:34,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:56:34,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:56:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,302 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:56:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767961944] [2025-01-09 04:56:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767961944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711177332] [2025-01-09 04:56:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:34,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:34,307 INFO L87 Difference]: Start difference. First operand 1156 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,350 INFO L93 Difference]: Finished difference Result 2286 states and 3333 transitions. [2025-01-09 04:56:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-01-09 04:56:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,358 INFO L225 Difference]: With dead ends: 2286 [2025-01-09 04:56:34,358 INFO L226 Difference]: Without dead ends: 1158 [2025-01-09 04:56:34,360 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:56:34,363 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-01-09 04:56:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2025-01-09 04:56:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1153 states have (on average 1.4657415437987857) internal successors, (1690), 1157 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1690 transitions. [2025-01-09 04:56:34,407 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1690 transitions. Word has length 151 [2025-01-09 04:56:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,408 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1690 transitions. [2025-01-09 04:56:34,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1690 transitions. [2025-01-09 04:56:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:56:34,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:56:34,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:34,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1852245384, now seen corresponding path program 1 times [2025-01-09 04:56:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522353740] [2025-01-09 04:56:34,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:56:34,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:56:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,000 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:56:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522353740] [2025-01-09 04:56:35,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522353740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132909892] [2025-01-09 04:56:35,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:35,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:35,002 INFO L87 Difference]: Start difference. First operand 1158 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,057 INFO L93 Difference]: Finished difference Result 2306 states and 3366 transitions. [2025-01-09 04:56:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-01-09 04:56:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,063 INFO L225 Difference]: With dead ends: 2306 [2025-01-09 04:56:35,064 INFO L226 Difference]: Without dead ends: 1156 [2025-01-09 04:56:35,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:35,070 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 24 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1890 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-09 04:56:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-09 04:56:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.4648132059079062) internal successors, (1686), 1155 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1686 transitions. [2025-01-09 04:56:35,107 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1686 transitions. Word has length 152 [2025-01-09 04:56:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:35,107 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1686 transitions. [2025-01-09 04:56:35,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1686 transitions. [2025-01-09 04:56:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:56:35,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:35,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:56:35,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:35,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1568302179, now seen corresponding path program 1 times [2025-01-09 04:56:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135262163] [2025-01-09 04:56:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:56:35,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:56:35,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:35,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,257 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:56:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135262163] [2025-01-09 04:56:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135262163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123335612] [2025-01-09 04:56:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:35,260 INFO L87 Difference]: Start difference. First operand 1156 states and 1686 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,361 INFO L93 Difference]: Finished difference Result 2692 states and 3927 transitions. [2025-01-09 04:56:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-01-09 04:56:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,369 INFO L225 Difference]: With dead ends: 2692 [2025-01-09 04:56:35,370 INFO L226 Difference]: Without dead ends: 1727 [2025-01-09 04:56:35,371 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:56:35,373 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 528 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1690 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-01-09 04:56:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1700. [2025-01-09 04:56:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1695 states have (on average 1.448377581120944) internal successors, (2455), 1699 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2455 transitions. [2025-01-09 04:56:35,418 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2455 transitions. Word has length 152 [2025-01-09 04:56:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2455 transitions. [2025-01-09 04:56:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2455 transitions. [2025-01-09 04:56:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 04:56:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:35,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:56:35,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 781372132, now seen corresponding path program 1 times [2025-01-09 04:56:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408287973] [2025-01-09 04:56:35,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:35,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:56:35,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:56:35,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:35,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,539 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:56:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408287973] [2025-01-09 04:56:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408287973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98449416] [2025-01-09 04:56:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:35,541 INFO L87 Difference]: Start difference. First operand 1700 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,612 INFO L93 Difference]: Finished difference Result 3988 states and 5884 transitions. [2025-01-09 04:56:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-01-09 04:56:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,623 INFO L225 Difference]: With dead ends: 3988 [2025-01-09 04:56:35,624 INFO L226 Difference]: Without dead ends: 2470 [2025-01-09 04:56:35,627 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:56:35,628 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 315 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1279 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2025-01-09 04:56:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2142. [2025-01-09 04:56:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2137 states have (on average 1.486195601310248) internal successors, (3176), 2141 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3176 transitions. [2025-01-09 04:56:35,691 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3176 transitions. Word has length 154 [2025-01-09 04:56:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:35,692 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 3176 transitions. [2025-01-09 04:56:35,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3176 transitions. [2025-01-09 04:56:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:56:35,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:35,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:56:35,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1705023188, now seen corresponding path program 1 times [2025-01-09 04:56:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834233140] [2025-01-09 04:56:35,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:35,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:56:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:56:35,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:35,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,812 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:56:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834233140] [2025-01-09 04:56:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834233140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875698556] [2025-01-09 04:56:35,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:35,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:35,814 INFO L87 Difference]: Start difference. First operand 2142 states and 3176 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,908 INFO L93 Difference]: Finished difference Result 5128 states and 7761 transitions. [2025-01-09 04:56:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-01-09 04:56:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,923 INFO L225 Difference]: With dead ends: 5128 [2025-01-09 04:56:35,923 INFO L226 Difference]: Without dead ends: 3252 [2025-01-09 04:56:35,927 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:56:35,929 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 352 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1281 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2025-01-09 04:56:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2920. [2025-01-09 04:56:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2915 states have (on average 1.5217838765008576) internal successors, (4436), 2919 states have internal predecessors, (4436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4436 transitions. [2025-01-09 04:56:36,011 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4436 transitions. Word has length 156 [2025-01-09 04:56:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:36,011 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4436 transitions. [2025-01-09 04:56:36,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4436 transitions. [2025-01-09 04:56:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:56:36,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:36,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:56:36,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:36,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1816910392, now seen corresponding path program 1 times [2025-01-09 04:56:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370142914] [2025-01-09 04:56:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:36,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:56:36,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:56:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:36,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:56:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370142914] [2025-01-09 04:56:36,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370142914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:36,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243600992] [2025-01-09 04:56:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:36,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:36,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:36,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:36,516 INFO L87 Difference]: Start difference. First operand 2920 states and 4436 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:36,678 INFO L93 Difference]: Finished difference Result 7050 states and 11024 transitions. [2025-01-09 04:56:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-01-09 04:56:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:36,700 INFO L225 Difference]: With dead ends: 7050 [2025-01-09 04:56:36,701 INFO L226 Difference]: Without dead ends: 5228 [2025-01-09 04:56:36,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:36,706 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 714 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:36,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1098 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2025-01-09 04:56:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5226. [2025-01-09 04:56:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 5221 states have (on average 1.5378280022984103) internal successors, (8029), 5225 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 8029 transitions. [2025-01-09 04:56:36,882 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 8029 transitions. Word has length 157 [2025-01-09 04:56:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:36,883 INFO L471 AbstractCegarLoop]: Abstraction has 5226 states and 8029 transitions. [2025-01-09 04:56:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 8029 transitions. [2025-01-09 04:56:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:56:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:36,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:56:36,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash -837981990, now seen corresponding path program 1 times [2025-01-09 04:56:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238055421] [2025-01-09 04:56:36,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:36,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:56:37,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:56:37,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:37,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:37,322 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:56:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238055421] [2025-01-09 04:56:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238055421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116388152] [2025-01-09 04:56:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:37,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:37,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:37,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:37,326 INFO L87 Difference]: Start difference. First operand 5226 states and 8029 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:37,517 INFO L93 Difference]: Finished difference Result 13670 states and 20995 transitions. [2025-01-09 04:56:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-01-09 04:56:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:37,561 INFO L225 Difference]: With dead ends: 13670 [2025-01-09 04:56:37,562 INFO L226 Difference]: Without dead ends: 8481 [2025-01-09 04:56:37,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:37,569 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 529 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:37,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2025-01-09 04:56:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 8458. [2025-01-09 04:56:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8458 states, 8453 states have (on average 1.524429196734887) internal successors, (12886), 8457 states have internal predecessors, (12886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 12886 transitions. [2025-01-09 04:56:37,802 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 12886 transitions. Word has length 157 [2025-01-09 04:56:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:37,802 INFO L471 AbstractCegarLoop]: Abstraction has 8458 states and 12886 transitions. [2025-01-09 04:56:37,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 12886 transitions. [2025-01-09 04:56:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:56:37,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:37,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:37,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:56:37,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -728683137, now seen corresponding path program 1 times [2025-01-09 04:56:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951085280] [2025-01-09 04:56:37,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:37,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:56:37,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:56:37,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:38,277 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:56:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951085280] [2025-01-09 04:56:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951085280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:38,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:38,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:38,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135648208] [2025-01-09 04:56:38,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:38,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:38,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:38,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:38,283 INFO L87 Difference]: Start difference. First operand 8458 states and 12886 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:38,394 INFO L93 Difference]: Finished difference Result 16895 states and 25740 transitions. [2025-01-09 04:56:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-01-09 04:56:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:38,417 INFO L225 Difference]: With dead ends: 16895 [2025-01-09 04:56:38,417 INFO L226 Difference]: Without dead ends: 8458 [2025-01-09 04:56:38,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:38,429 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 20 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:38,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1862 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2025-01-09 04:56:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8458. [2025-01-09 04:56:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8458 states, 8453 states have (on average 1.5240742931503608) internal successors, (12883), 8457 states have internal predecessors, (12883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 12883 transitions. [2025-01-09 04:56:38,632 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 12883 transitions. Word has length 159 [2025-01-09 04:56:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:38,633 INFO L471 AbstractCegarLoop]: Abstraction has 8458 states and 12883 transitions. [2025-01-09 04:56:38,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 12883 transitions. [2025-01-09 04:56:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:56:38,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:56:38,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:38,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1379104380, now seen corresponding path program 1 times [2025-01-09 04:56:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:38,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277485853] [2025-01-09 04:56:38,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:38,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:56:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:56:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:38,786 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:56:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277485853] [2025-01-09 04:56:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277485853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822978926] [2025-01-09 04:56:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:38,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:38,789 INFO L87 Difference]: Start difference. First operand 8458 states and 12883 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:38,950 INFO L93 Difference]: Finished difference Result 21285 states and 32425 transitions. [2025-01-09 04:56:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-01-09 04:56:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:38,986 INFO L225 Difference]: With dead ends: 21285 [2025-01-09 04:56:38,986 INFO L226 Difference]: Without dead ends: 13219 [2025-01-09 04:56:39,001 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:56:39,002 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 523 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1220 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:39,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1220 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13219 states. [2025-01-09 04:56:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13219 to 13198. [2025-01-09 04:56:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13198 states, 13193 states have (on average 1.505040551807777) internal successors, (19856), 13197 states have internal predecessors, (19856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13198 states to 13198 states and 19856 transitions. [2025-01-09 04:56:39,330 INFO L78 Accepts]: Start accepts. Automaton has 13198 states and 19856 transitions. Word has length 159 [2025-01-09 04:56:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 13198 states and 19856 transitions. [2025-01-09 04:56:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13198 states and 19856 transitions. [2025-01-09 04:56:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 04:56:39,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:39,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:39,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:56:39,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:39,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1856649123, now seen corresponding path program 1 times [2025-01-09 04:56:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669470328] [2025-01-09 04:56:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:39,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 04:56:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 04:56:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:39,465 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:56:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669470328] [2025-01-09 04:56:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669470328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:39,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:39,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090998894] [2025-01-09 04:56:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:39,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:39,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:39,466 INFO L87 Difference]: Start difference. First operand 13198 states and 19856 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:39,710 INFO L93 Difference]: Finished difference Result 35081 states and 53528 transitions. [2025-01-09 04:56:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-01-09 04:56:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:39,771 INFO L225 Difference]: With dead ends: 35081 [2025-01-09 04:56:39,772 INFO L226 Difference]: Without dead ends: 22288 [2025-01-09 04:56:39,796 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:56:39,797 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 314 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:39,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1261 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2025-01-09 04:56:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 20122. [2025-01-09 04:56:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20122 states, 20117 states have (on average 1.5392951235273649) internal successors, (30966), 20121 states have internal predecessors, (30966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20122 states to 20122 states and 30966 transitions. [2025-01-09 04:56:40,376 INFO L78 Accepts]: Start accepts. Automaton has 20122 states and 30966 transitions. Word has length 163 [2025-01-09 04:56:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 20122 states and 30966 transitions. [2025-01-09 04:56:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20122 states and 30966 transitions. [2025-01-09 04:56:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:56:40,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:40,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:56:40,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1193982163, now seen corresponding path program 1 times [2025-01-09 04:56:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182706106] [2025-01-09 04:56:40,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:56:40,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:56:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:40,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182706106] [2025-01-09 04:56:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182706106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:40,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:40,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599623245] [2025-01-09 04:56:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:40,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:40,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:40,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:40,477 INFO L87 Difference]: Start difference. First operand 20122 states and 30966 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:41,043 INFO L93 Difference]: Finished difference Result 57900 states and 89640 transitions. [2025-01-09 04:56:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 04:56:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:41,162 INFO L225 Difference]: With dead ends: 57900 [2025-01-09 04:56:41,163 INFO L226 Difference]: Without dead ends: 39172 [2025-01-09 04:56:41,202 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:56:41,203 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 501 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:41,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1046 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:56:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39172 states. [2025-01-09 04:56:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39172 to 39137. [2025-01-09 04:56:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39137 states, 39132 states have (on average 1.5376418276602268) internal successors, (60171), 39136 states have internal predecessors, (60171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39137 states to 39137 states and 60171 transitions. [2025-01-09 04:56:42,147 INFO L78 Accepts]: Start accepts. Automaton has 39137 states and 60171 transitions. Word has length 164 [2025-01-09 04:56:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 39137 states and 60171 transitions. [2025-01-09 04:56:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39137 states and 60171 transitions. [2025-01-09 04:56:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:56:42,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:42,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:42,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:56:42,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:42,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1951177816, now seen corresponding path program 1 times [2025-01-09 04:56:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742660461] [2025-01-09 04:56:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:42,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:56:42,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:56:42,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:42,447 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:56:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:42,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742660461] [2025-01-09 04:56:42,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742660461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:42,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:56:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395120031] [2025-01-09 04:56:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:56:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:42,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:56:42,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:56:42,450 INFO L87 Difference]: Start difference. First operand 39137 states and 60171 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:43,848 INFO L93 Difference]: Finished difference Result 163556 states and 251726 transitions. [2025-01-09 04:56:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 04:56:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:44,421 INFO L225 Difference]: With dead ends: 163556 [2025-01-09 04:56:44,421 INFO L226 Difference]: Without dead ends: 125061 [2025-01-09 04:56:44,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:56:44,484 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 6948 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6948 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:44,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6948 Valid, 1541 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:56:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125061 states. [2025-01-09 04:56:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125061 to 66131. [2025-01-09 04:56:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66131 states, 66126 states have (on average 1.515909022169797) internal successors, (100241), 66130 states have internal predecessors, (100241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66131 states to 66131 states and 100241 transitions. [2025-01-09 04:56:46,305 INFO L78 Accepts]: Start accepts. Automaton has 66131 states and 100241 transitions. Word has length 164 [2025-01-09 04:56:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 66131 states and 100241 transitions. [2025-01-09 04:56:46,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 66131 states and 100241 transitions. [2025-01-09 04:56:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:56:46,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:46,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:56:46,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:46,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash -637177356, now seen corresponding path program 1 times [2025-01-09 04:56:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485316505] [2025-01-09 04:56:46,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:56:46,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:56:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:46,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:46,705 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:56:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485316505] [2025-01-09 04:56:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485316505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:46,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:46,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:46,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422325677] [2025-01-09 04:56:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:46,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:46,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:46,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:46,708 INFO L87 Difference]: Start difference. First operand 66131 states and 100241 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:48,299 INFO L93 Difference]: Finished difference Result 301411 states and 455269 transitions. [2025-01-09 04:56:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 04:56:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:48,983 INFO L225 Difference]: With dead ends: 301411 [2025-01-09 04:56:48,983 INFO L226 Difference]: Without dead ends: 235329 [2025-01-09 04:56:49,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:49,057 INFO L435 NwaCegarLoop]: 1024 mSDtfsCounter, 1656 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:49,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2634 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:56:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235329 states. [2025-01-09 04:56:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235329 to 117676. [2025-01-09 04:56:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117676 states, 117671 states have (on average 1.492440788299581) internal successors, (175617), 117675 states have internal predecessors, (175617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117676 states to 117676 states and 175617 transitions. [2025-01-09 04:56:51,920 INFO L78 Accepts]: Start accepts. Automaton has 117676 states and 175617 transitions. Word has length 164 [2025-01-09 04:56:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:51,920 INFO L471 AbstractCegarLoop]: Abstraction has 117676 states and 175617 transitions. [2025-01-09 04:56:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 117676 states and 175617 transitions. [2025-01-09 04:56:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:56:51,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:51,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:51,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:56:51,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1188003318, now seen corresponding path program 1 times [2025-01-09 04:56:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513907278] [2025-01-09 04:56:51,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:51,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:56:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:56:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:52,030 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:56:52,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513907278] [2025-01-09 04:56:52,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513907278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:52,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832328247] [2025-01-09 04:56:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:52,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:52,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:52,035 INFO L87 Difference]: Start difference. First operand 117676 states and 175617 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:53,096 INFO L93 Difference]: Finished difference Result 235235 states and 351079 transitions. [2025-01-09 04:56:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:53,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-01-09 04:56:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:53,373 INFO L225 Difference]: With dead ends: 235235 [2025-01-09 04:56:53,374 INFO L226 Difference]: Without dead ends: 117684 [2025-01-09 04:56:53,486 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:56:53,487 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:53,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117684 states. [2025-01-09 04:56:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117684 to 117684. [2025-01-09 04:56:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117684 states, 117679 states have (on average 1.4924073114149508) internal successors, (175625), 117683 states have internal predecessors, (175625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117684 states to 117684 states and 175625 transitions. [2025-01-09 04:56:55,589 INFO L78 Accepts]: Start accepts. Automaton has 117684 states and 175625 transitions. Word has length 165 [2025-01-09 04:56:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:55,589 INFO L471 AbstractCegarLoop]: Abstraction has 117684 states and 175625 transitions. [2025-01-09 04:56:55,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 117684 states and 175625 transitions. [2025-01-09 04:56:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:56:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:55,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:56:55,608 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -951591691, now seen corresponding path program 1 times [2025-01-09 04:56:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238257196] [2025-01-09 04:56:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:55,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:56:55,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:56:55,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:55,992 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:56:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238257196] [2025-01-09 04:56:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238257196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265816692] [2025-01-09 04:56:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:55,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:55,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:55,995 INFO L87 Difference]: Start difference. First operand 117684 states and 175625 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:56,905 INFO L93 Difference]: Finished difference Result 235239 states and 351081 transitions. [2025-01-09 04:56:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:56,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-09 04:56:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:57,078 INFO L225 Difference]: With dead ends: 235239 [2025-01-09 04:56:57,079 INFO L226 Difference]: Without dead ends: 117684 [2025-01-09 04:56:57,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:57,172 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 10 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:57,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1808 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117684 states. [2025-01-09 04:56:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117684 to 117680. [2025-01-09 04:56:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117680 states, 117675 states have (on average 1.4923815593796472) internal successors, (175616), 117679 states have internal predecessors, (175616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117680 states to 117680 states and 175616 transitions. [2025-01-09 04:56:59,040 INFO L78 Accepts]: Start accepts. Automaton has 117680 states and 175616 transitions. Word has length 166 [2025-01-09 04:56:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 117680 states and 175616 transitions. [2025-01-09 04:56:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117680 states and 175616 transitions. [2025-01-09 04:56:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:56:59,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:59,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:56:59,061 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:56:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 718071364, now seen corresponding path program 1 times [2025-01-09 04:56:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:59,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080898932] [2025-01-09 04:56:59,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:59,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:56:59,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:56:59,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080898932] [2025-01-09 04:56:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080898932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951759019] [2025-01-09 04:56:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:59,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:59,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:59,182 INFO L87 Difference]: Start difference. First operand 117680 states and 175616 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:00,417 INFO L93 Difference]: Finished difference Result 310480 states and 462470 transitions. [2025-01-09 04:57:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-09 04:57:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:00,701 INFO L225 Difference]: With dead ends: 310480 [2025-01-09 04:57:00,701 INFO L226 Difference]: Without dead ends: 193999 [2025-01-09 04:57:00,797 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:57:00,798 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 500 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:00,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1580 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:57:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193999 states. [2025-01-09 04:57:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193999 to 193956. [2025-01-09 04:57:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193956 states, 193951 states have (on average 1.4731659027280086) internal successors, (285722), 193955 states have internal predecessors, (285722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193956 states to 193956 states and 285722 transitions. [2025-01-09 04:57:03,790 INFO L78 Accepts]: Start accepts. Automaton has 193956 states and 285722 transitions. Word has length 166 [2025-01-09 04:57:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:03,790 INFO L471 AbstractCegarLoop]: Abstraction has 193956 states and 285722 transitions. [2025-01-09 04:57:03,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 193956 states and 285722 transitions. [2025-01-09 04:57:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:57:03,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:03,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:57:03,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:57:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -427288287, now seen corresponding path program 1 times [2025-01-09 04:57:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391771492] [2025-01-09 04:57:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:57:03,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:57:03,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:03,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:04,707 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:57:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391771492] [2025-01-09 04:57:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391771492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805701405] [2025-01-09 04:57:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:04,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:04,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:04,710 INFO L87 Difference]: Start difference. First operand 193956 states and 285722 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:05,655 INFO L93 Difference]: Finished difference Result 364638 states and 537495 transitions. [2025-01-09 04:57:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:05,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-09 04:57:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:06,391 INFO L225 Difference]: With dead ends: 364638 [2025-01-09 04:57:06,391 INFO L226 Difference]: Without dead ends: 171733 [2025-01-09 04:57:06,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:06,488 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 13 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:06,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1812 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171733 states. [2025-01-09 04:57:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171733 to 171733. [2025-01-09 04:57:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171733 states, 171728 states have (on average 1.4732891549427) internal successors, (253005), 171732 states have internal predecessors, (253005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171733 states to 171733 states and 253005 transitions. [2025-01-09 04:57:08,930 INFO L78 Accepts]: Start accepts. Automaton has 171733 states and 253005 transitions. Word has length 166 [2025-01-09 04:57:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:08,931 INFO L471 AbstractCegarLoop]: Abstraction has 171733 states and 253005 transitions. [2025-01-09 04:57:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 171733 states and 253005 transitions. [2025-01-09 04:57:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:57:08,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:08,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:57:08,971 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:57:08,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 572311663, now seen corresponding path program 1 times [2025-01-09 04:57:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374803237] [2025-01-09 04:57:08,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:09,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:57:09,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:57:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:09,641 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:57:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374803237] [2025-01-09 04:57:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374803237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:57:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472486263] [2025-01-09 04:57:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:57:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:09,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:57:09,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:57:09,644 INFO L87 Difference]: Start difference. First operand 171733 states and 253005 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:12,495 INFO L93 Difference]: Finished difference Result 545429 states and 806875 transitions. [2025-01-09 04:57:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:57:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-09 04:57:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:13,909 INFO L225 Difference]: With dead ends: 545429 [2025-01-09 04:57:13,910 INFO L226 Difference]: Without dead ends: 376438 [2025-01-09 04:57:14,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:57:14,003 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 5781 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:14,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 2740 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:57:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376438 states. [2025-01-09 04:57:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376438 to 162819. [2025-01-09 04:57:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162819 states, 162814 states have (on average 1.4825690665421893) internal successors, (241383), 162818 states have internal predecessors, (241383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162819 states to 162819 states and 241383 transitions. [2025-01-09 04:57:18,368 INFO L78 Accepts]: Start accepts. Automaton has 162819 states and 241383 transitions. Word has length 171 [2025-01-09 04:57:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 162819 states and 241383 transitions. [2025-01-09 04:57:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 162819 states and 241383 transitions. [2025-01-09 04:57:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:57:18,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:18,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:57:18,383 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:57:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1547419730, now seen corresponding path program 1 times [2025-01-09 04:57:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295194951] [2025-01-09 04:57:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:18,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:57:18,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:57:18,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:18,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:18,662 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:57:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295194951] [2025-01-09 04:57:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295194951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112799714] [2025-01-09 04:57:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:18,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:18,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:18,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:18,665 INFO L87 Difference]: Start difference. First operand 162819 states and 241383 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:19,291 INFO L93 Difference]: Finished difference Result 233640 states and 347058 transitions. [2025-01-09 04:57:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-09 04:57:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:19,552 INFO L225 Difference]: With dead ends: 233640 [2025-01-09 04:57:19,552 INFO L226 Difference]: Without dead ends: 162345 [2025-01-09 04:57:19,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:19,647 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 105 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1866 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162345 states. [2025-01-09 04:57:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162345 to 161910. [2025-01-09 04:57:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161910 states, 161905 states have (on average 1.4837157592415304) internal successors, (240221), 161909 states have internal predecessors, (240221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161910 states to 161910 states and 240221 transitions. [2025-01-09 04:57:22,133 INFO L78 Accepts]: Start accepts. Automaton has 161910 states and 240221 transitions. Word has length 171 [2025-01-09 04:57:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 161910 states and 240221 transitions. [2025-01-09 04:57:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 161910 states and 240221 transitions. [2025-01-09 04:57:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:57:22,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:22,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:22,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:57:22,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:57:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2106025508, now seen corresponding path program 1 times [2025-01-09 04:57:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137047872] [2025-01-09 04:57:22,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:22,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:57:22,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:57:22,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:22,249 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:57:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137047872] [2025-01-09 04:57:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137047872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751781729] [2025-01-09 04:57:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:22,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:22,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:22,251 INFO L87 Difference]: Start difference. First operand 161910 states and 240221 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)