./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:34:57,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:34:57,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:34:57,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:34:57,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:34:57,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:34:57,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:34:57,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:34:57,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:34:57,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:34:57,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:34:57,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:34:57,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:34:57,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:34:57,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:34:57,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:34:57,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:34:57,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:34:57,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:34:57,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:34:57,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:34:57,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:34:57,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:34:57,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:34:57,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:34:57,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:34:57,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:34:57,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:34:57,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:34:57,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:34:57,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:34:57,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:34:57,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:34:57,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:34:57,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:34:57,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:34:57,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:34:57,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac [2024-10-11 03:34:58,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:34:58,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:34:58,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:34:58,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:34:58,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:34:58,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:34:59,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:34:59,781 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:34:59,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:34:59,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/630c47837/b106d74d96af40a295137a745b168c5a/FLAGf79f781cb [2024-10-11 03:34:59,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/630c47837/b106d74d96af40a295137a745b168c5a [2024-10-11 03:34:59,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:34:59,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:34:59,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:34:59,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:34:59,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:34:59,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:34:59" (1/1) ... [2024-10-11 03:34:59,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327c827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:59, skipping insertion in model container [2024-10-11 03:34:59,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:34:59" (1/1) ... [2024-10-11 03:34:59,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:35:00,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2024-10-11 03:35:00,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2024-10-11 03:35:00,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2024-10-11 03:35:00,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2024-10-11 03:35:00,280 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2024-10-11 03:35:00,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:00,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:35:00,420 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2024-10-11 03:35:00,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2024-10-11 03:35:00,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2024-10-11 03:35:00,444 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2024-10-11 03:35:00,473 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2024-10-11 03:35:00,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:00,516 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:35:00,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00 WrapperNode [2024-10-11 03:35:00,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:00,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:00,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:35:00,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:35:00,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,593 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1636 [2024-10-11 03:35:00,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:00,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:35:00,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:35:00,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:35:00,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,650 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]. [2024-10-11 03:35:00,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:35:00,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:35:00,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:35:00,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:35:00,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (1/1) ... [2024-10-11 03:35:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:35:00,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:35:00,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:35:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:35:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:35:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:35:00,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:35:00,915 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:35:00,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:35:02,038 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-11 03:35:02,039 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:35:02,089 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:35:02,092 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:35:02,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:02 BoogieIcfgContainer [2024-10-11 03:35:02,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:35:02,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:35:02,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:35:02,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:35:02,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:34:59" (1/3) ... [2024-10-11 03:35:02,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eef2a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:02, skipping insertion in model container [2024-10-11 03:35:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:00" (2/3) ... [2024-10-11 03:35:02,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eef2a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:02, skipping insertion in model container [2024-10-11 03:35:02,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:02" (3/3) ... [2024-10-11 03:35:02,101 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:35:02,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:35:02,116 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-11 03:35:02,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:35:02,180 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;@602dbf25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:35:02,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 03:35:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 369 states have (on average 1.8319783197831978) internal successors, (676), 374 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 03:35:02,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:02,201 INFO L215 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] [2024-10-11 03:35:02,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1543552980, now seen corresponding path program 1 times [2024-10-11 03:35:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675249419] [2024-10-11 03:35:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675249419] [2024-10-11 03:35:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675249419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990559880] [2024-10-11 03:35:02,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:02,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:02,802 INFO L87 Difference]: Start difference. First operand has 375 states, 369 states have (on average 1.8319783197831978) internal successors, (676), 374 states have internal predecessors, (676), 0 states have call successors, (0), 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 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:02,957 INFO L93 Difference]: Finished difference Result 679 states and 1213 transitions. [2024-10-11 03:35:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-10-11 03:35:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:02,978 INFO L225 Difference]: With dead ends: 679 [2024-10-11 03:35:02,978 INFO L226 Difference]: Without dead ends: 545 [2024-10-11 03:35:02,984 INFO L431 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 [2024-10-11 03:35:02,987 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 390 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:02,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1199 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-11 03:35:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2024-10-11 03:35:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 538 states have (on average 1.4814126394052045) internal successors, (797), 542 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2024-10-11 03:35:03,063 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 138 [2024-10-11 03:35:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2024-10-11 03:35:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2024-10-11 03:35:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 03:35:03,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:03,067 INFO L215 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] [2024-10-11 03:35:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:35:03,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -228007275, now seen corresponding path program 1 times [2024-10-11 03:35:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045254259] [2024-10-11 03:35:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:03,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045254259] [2024-10-11 03:35:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045254259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796030552] [2024-10-11 03:35:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:03,277 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:03,404 INFO L93 Difference]: Finished difference Result 1092 states and 1657 transitions. [2024-10-11 03:35:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-10-11 03:35:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:03,412 INFO L225 Difference]: With dead ends: 1092 [2024-10-11 03:35:03,412 INFO L226 Difference]: Without dead ends: 901 [2024-10-11 03:35:03,413 INFO L431 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 [2024-10-11 03:35:03,414 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 312 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:03,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 977 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-10-11 03:35:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 899. [2024-10-11 03:35:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 894 states have (on average 1.5033557046979866) internal successors, (1344), 898 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1344 transitions. [2024-10-11 03:35:03,446 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1344 transitions. Word has length 138 [2024-10-11 03:35:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1344 transitions. [2024-10-11 03:35:03,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1344 transitions. [2024-10-11 03:35:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 03:35:03,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:03,449 INFO L215 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] [2024-10-11 03:35:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:35:03,450 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)] === [2024-10-11 03:35:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -228438251, now seen corresponding path program 1 times [2024-10-11 03:35:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922870545] [2024-10-11 03:35:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922870545] [2024-10-11 03:35:03,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922870545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:03,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:03,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555955715] [2024-10-11 03:35:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:03,924 INFO L87 Difference]: Start difference. First operand 899 states and 1344 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:04,037 INFO L93 Difference]: Finished difference Result 3457 states and 5143 transitions. [2024-10-11 03:35:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:04,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-10-11 03:35:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:04,046 INFO L225 Difference]: With dead ends: 3457 [2024-10-11 03:35:04,046 INFO L226 Difference]: Without dead ends: 2582 [2024-10-11 03:35:04,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:04,051 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 969 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:04,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1906 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2024-10-11 03:35:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1702. [2024-10-11 03:35:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1697 states have (on average 1.4896876841484974) internal successors, (2528), 1701 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2528 transitions. [2024-10-11 03:35:04,089 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2528 transitions. Word has length 138 [2024-10-11 03:35:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2528 transitions. [2024-10-11 03:35:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2528 transitions. [2024-10-11 03:35:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:35:04,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:04,093 INFO L215 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] [2024-10-11 03:35:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:35:04,094 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)] === [2024-10-11 03:35:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -802546345, now seen corresponding path program 1 times [2024-10-11 03:35:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674757787] [2024-10-11 03:35:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674757787] [2024-10-11 03:35:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674757787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710211714] [2024-10-11 03:35:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:04,186 INFO L87 Difference]: Start difference. First operand 1702 states and 2528 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:04,212 INFO L93 Difference]: Finished difference Result 3379 states and 5013 transitions. [2024-10-11 03:35:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-10-11 03:35:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:04,217 INFO L225 Difference]: With dead ends: 3379 [2024-10-11 03:35:04,217 INFO L226 Difference]: Without dead ends: 1704 [2024-10-11 03:35:04,220 INFO L431 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 [2024-10-11 03:35:04,222 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:04,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2024-10-11 03:35:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2024-10-11 03:35:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1699 states have (on average 1.489111241907004) internal successors, (2530), 1703 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2530 transitions. [2024-10-11 03:35:04,251 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2530 transitions. Word has length 139 [2024-10-11 03:35:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2530 transitions. [2024-10-11 03:35:04,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2530 transitions. [2024-10-11 03:35:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:35:04,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:04,253 INFO L215 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] [2024-10-11 03:35:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:35:04,253 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)] === [2024-10-11 03:35:04,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1692246653, now seen corresponding path program 1 times [2024-10-11 03:35:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:04,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790453512] [2024-10-11 03:35:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790453512] [2024-10-11 03:35:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790453512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207887084] [2024-10-11 03:35:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:04,362 INFO L87 Difference]: Start difference. First operand 1704 states and 2530 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:04,418 INFO L93 Difference]: Finished difference Result 4482 states and 6649 transitions. [2024-10-11 03:35:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-10-11 03:35:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:04,428 INFO L225 Difference]: With dead ends: 4482 [2024-10-11 03:35:04,428 INFO L226 Difference]: Without dead ends: 2955 [2024-10-11 03:35:04,430 INFO L431 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 [2024-10-11 03:35:04,431 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 465 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:04,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1285 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-10-11 03:35:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2915. [2024-10-11 03:35:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2910 states have (on average 1.467697594501718) internal successors, (4271), 2914 states have internal predecessors, (4271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4271 transitions. [2024-10-11 03:35:04,482 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4271 transitions. Word has length 140 [2024-10-11 03:35:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:04,483 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4271 transitions. [2024-10-11 03:35:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4271 transitions. [2024-10-11 03:35:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:35:04,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:04,487 INFO L215 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] [2024-10-11 03:35:04,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:35:04,487 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)] === [2024-10-11 03:35:04,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1587774842, now seen corresponding path program 1 times [2024-10-11 03:35:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281680976] [2024-10-11 03:35:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:04,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281680976] [2024-10-11 03:35:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281680976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:04,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911300147] [2024-10-11 03:35:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:04,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:04,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:04,891 INFO L87 Difference]: Start difference. First operand 2915 states and 4271 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:04,933 INFO L93 Difference]: Finished difference Result 5252 states and 7712 transitions. [2024-10-11 03:35:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-10-11 03:35:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:04,941 INFO L225 Difference]: With dead ends: 5252 [2024-10-11 03:35:04,943 INFO L226 Difference]: Without dead ends: 2504 [2024-10-11 03:35:04,946 INFO L431 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 [2024-10-11 03:35:04,950 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 25 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:04,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1686 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-11 03:35:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2024-10-11 03:35:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2499 states have (on average 1.4661864745898359) internal successors, (3664), 2503 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3664 transitions. [2024-10-11 03:35:04,985 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3664 transitions. Word has length 140 [2024-10-11 03:35:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3664 transitions. [2024-10-11 03:35:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3664 transitions. [2024-10-11 03:35:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:35:04,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:04,989 INFO L215 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] [2024-10-11 03:35:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:35:04,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1861594925, now seen corresponding path program 1 times [2024-10-11 03:35:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465761590] [2024-10-11 03:35:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465761590] [2024-10-11 03:35:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465761590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698420952] [2024-10-11 03:35:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:05,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:05,084 INFO L87 Difference]: Start difference. First operand 2504 states and 3664 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:05,292 INFO L93 Difference]: Finished difference Result 6985 states and 10274 transitions. [2024-10-11 03:35:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-11 03:35:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:05,306 INFO L225 Difference]: With dead ends: 6985 [2024-10-11 03:35:05,306 INFO L226 Difference]: Without dead ends: 4800 [2024-10-11 03:35:05,310 INFO L431 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 [2024-10-11 03:35:05,311 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 390 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:05,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 915 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2024-10-11 03:35:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4760. [2024-10-11 03:35:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4755 states have (on average 1.4601472134595164) internal successors, (6943), 4759 states have internal predecessors, (6943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6943 transitions. [2024-10-11 03:35:05,424 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6943 transitions. Word has length 146 [2024-10-11 03:35:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:05,426 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6943 transitions. [2024-10-11 03:35:05,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6943 transitions. [2024-10-11 03:35:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:35:05,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:05,430 INFO L215 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] [2024-10-11 03:35:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:35:05,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -24262088, now seen corresponding path program 1 times [2024-10-11 03:35:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498935787] [2024-10-11 03:35:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498935787] [2024-10-11 03:35:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498935787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 03:35:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052366939] [2024-10-11 03:35:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:35:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:35:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:35:06,456 INFO L87 Difference]: Start difference. First operand 4760 states and 6943 transitions. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:07,330 INFO L93 Difference]: Finished difference Result 8069 states and 11968 transitions. [2024-10-11 03:35:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:35:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-11 03:35:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:07,349 INFO L225 Difference]: With dead ends: 8069 [2024-10-11 03:35:07,349 INFO L226 Difference]: Without dead ends: 6477 [2024-10-11 03:35:07,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:35:07,353 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 3450 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3450 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:07,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3450 Valid, 4901 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:35:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6477 states. [2024-10-11 03:35:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6477 to 5219. [2024-10-11 03:35:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5214 states have (on average 1.4455312619869582) internal successors, (7537), 5218 states have internal predecessors, (7537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 7537 transitions. [2024-10-11 03:35:07,477 INFO L78 Accepts]: Start accepts. Automaton has 5219 states and 7537 transitions. Word has length 146 [2024-10-11 03:35:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:07,478 INFO L471 AbstractCegarLoop]: Abstraction has 5219 states and 7537 transitions. [2024-10-11 03:35:07,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5219 states and 7537 transitions. [2024-10-11 03:35:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:35:07,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:07,485 INFO L215 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] [2024-10-11 03:35:07,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:35:07,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:07,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash -329897754, now seen corresponding path program 1 times [2024-10-11 03:35:07,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516547225] [2024-10-11 03:35:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516547225] [2024-10-11 03:35:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516547225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676733751] [2024-10-11 03:35:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:07,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:07,817 INFO L87 Difference]: Start difference. First operand 5219 states and 7537 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:07,897 INFO L93 Difference]: Finished difference Result 13722 states and 19759 transitions. [2024-10-11 03:35:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-11 03:35:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:07,919 INFO L225 Difference]: With dead ends: 13722 [2024-10-11 03:35:07,919 INFO L226 Difference]: Without dead ends: 8539 [2024-10-11 03:35:07,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:07,927 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 468 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:07,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1836 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8539 states. [2024-10-11 03:35:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8539 to 8509. [2024-10-11 03:35:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8509 states, 8504 states have (on average 1.424623706491063) internal successors, (12115), 8508 states have internal predecessors, (12115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 12115 transitions. [2024-10-11 03:35:08,054 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 12115 transitions. Word has length 146 [2024-10-11 03:35:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:08,055 INFO L471 AbstractCegarLoop]: Abstraction has 8509 states and 12115 transitions. [2024-10-11 03:35:08,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 12115 transitions. [2024-10-11 03:35:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:35:08,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:08,063 INFO L215 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] [2024-10-11 03:35:08,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:35:08,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1314666681, now seen corresponding path program 1 times [2024-10-11 03:35:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389082917] [2024-10-11 03:35:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389082917] [2024-10-11 03:35:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389082917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:08,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864150292] [2024-10-11 03:35:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:08,121 INFO L87 Difference]: Start difference. First operand 8509 states and 12115 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:08,164 INFO L93 Difference]: Finished difference Result 18845 states and 26757 transitions. [2024-10-11 03:35:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:08,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-10-11 03:35:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:08,184 INFO L225 Difference]: With dead ends: 18845 [2024-10-11 03:35:08,185 INFO L226 Difference]: Without dead ends: 12032 [2024-10-11 03:35:08,195 INFO L431 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 [2024-10-11 03:35:08,196 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 505 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1500 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 [2024-10-11 03:35:08,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1500 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2024-10-11 03:35:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 8509. [2024-10-11 03:35:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8509 states, 8504 states have (on average 1.4245061147695202) internal successors, (12114), 8508 states have internal predecessors, (12114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 12114 transitions. [2024-10-11 03:35:08,413 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 12114 transitions. Word has length 147 [2024-10-11 03:35:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:08,413 INFO L471 AbstractCegarLoop]: Abstraction has 8509 states and 12114 transitions. [2024-10-11 03:35:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 12114 transitions. [2024-10-11 03:35:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:35:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:08,423 INFO L215 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] [2024-10-11 03:35:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:35:08,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1146821218, now seen corresponding path program 1 times [2024-10-11 03:35:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450996897] [2024-10-11 03:35:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450996897] [2024-10-11 03:35:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450996897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745088871] [2024-10-11 03:35:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:08,503 INFO L87 Difference]: Start difference. First operand 8509 states and 12114 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:08,596 INFO L93 Difference]: Finished difference Result 22951 states and 32607 transitions. [2024-10-11 03:35:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-11 03:35:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:08,623 INFO L225 Difference]: With dead ends: 22951 [2024-10-11 03:35:08,623 INFO L226 Difference]: Without dead ends: 14956 [2024-10-11 03:35:08,636 INFO L431 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 [2024-10-11 03:35:08,637 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 455 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:08,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1357 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14956 states. [2024-10-11 03:35:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14956 to 14930. [2024-10-11 03:35:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14930 states, 14925 states have (on average 1.4018090452261307) internal successors, (20922), 14929 states have internal predecessors, (20922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14930 states to 14930 states and 20922 transitions. [2024-10-11 03:35:08,877 INFO L78 Accepts]: Start accepts. Automaton has 14930 states and 20922 transitions. Word has length 148 [2024-10-11 03:35:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 14930 states and 20922 transitions. [2024-10-11 03:35:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14930 states and 20922 transitions. [2024-10-11 03:35:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:35:08,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:08,890 INFO L215 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] [2024-10-11 03:35:08,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:35:08,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:08,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash -360830683, now seen corresponding path program 1 times [2024-10-11 03:35:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:08,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289575899] [2024-10-11 03:35:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:09,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289575899] [2024-10-11 03:35:09,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289575899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:09,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:09,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064627412] [2024-10-11 03:35:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:09,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:09,213 INFO L87 Difference]: Start difference. First operand 14930 states and 20922 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:09,406 INFO L93 Difference]: Finished difference Result 57576 states and 80267 transitions. [2024-10-11 03:35:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-11 03:35:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:09,472 INFO L225 Difference]: With dead ends: 57576 [2024-10-11 03:35:09,472 INFO L226 Difference]: Without dead ends: 42734 [2024-10-11 03:35:09,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:09,500 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 1005 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:09,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1883 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42734 states. [2024-10-11 03:35:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42734 to 28777. [2024-10-11 03:35:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28777 states, 28772 states have (on average 1.3825941887946616) internal successors, (39780), 28776 states have internal predecessors, (39780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28777 states to 28777 states and 39780 transitions. [2024-10-11 03:35:10,076 INFO L78 Accepts]: Start accepts. Automaton has 28777 states and 39780 transitions. Word has length 148 [2024-10-11 03:35:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:10,076 INFO L471 AbstractCegarLoop]: Abstraction has 28777 states and 39780 transitions. [2024-10-11 03:35:10,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28777 states and 39780 transitions. [2024-10-11 03:35:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 03:35:10,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:10,100 INFO L215 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] [2024-10-11 03:35:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:35:10,101 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 939486407, now seen corresponding path program 1 times [2024-10-11 03:35:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421847168] [2024-10-11 03:35:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421847168] [2024-10-11 03:35:10,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421847168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:10,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:10,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839576711] [2024-10-11 03:35:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:10,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:10,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:10,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:10,166 INFO L87 Difference]: Start difference. First operand 28777 states and 39780 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:10,294 INFO L93 Difference]: Finished difference Result 57413 states and 79357 transitions. [2024-10-11 03:35:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2024-10-11 03:35:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:10,337 INFO L225 Difference]: With dead ends: 57413 [2024-10-11 03:35:10,337 INFO L226 Difference]: Without dead ends: 28789 [2024-10-11 03:35:10,365 INFO L431 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 [2024-10-11 03:35:10,367 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:10,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1063 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28789 states. [2024-10-11 03:35:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28789 to 28789. [2024-10-11 03:35:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28789 states, 28784 states have (on average 1.3824346859366314) internal successors, (39792), 28788 states have internal predecessors, (39792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28789 states to 28789 states and 39792 transitions. [2024-10-11 03:35:10,876 INFO L78 Accepts]: Start accepts. Automaton has 28789 states and 39792 transitions. Word has length 149 [2024-10-11 03:35:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:10,876 INFO L471 AbstractCegarLoop]: Abstraction has 28789 states and 39792 transitions. [2024-10-11 03:35:10,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28789 states and 39792 transitions. [2024-10-11 03:35:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:35:10,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:10,906 INFO L215 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] [2024-10-11 03:35:10,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:35:10,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:10,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 421697284, now seen corresponding path program 1 times [2024-10-11 03:35:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:10,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773303737] [2024-10-11 03:35:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773303737] [2024-10-11 03:35:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773303737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065779513] [2024-10-11 03:35:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:11,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:11,400 INFO L87 Difference]: Start difference. First operand 28789 states and 39792 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) [2024-10-11 03:35:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:11,525 INFO L93 Difference]: Finished difference Result 53837 states and 74468 transitions. [2024-10-11 03:35:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:11,526 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 [2024-10-11 03:35:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:11,563 INFO L225 Difference]: With dead ends: 53837 [2024-10-11 03:35:11,563 INFO L226 Difference]: Without dead ends: 25575 [2024-10-11 03:35:11,587 INFO L431 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 [2024-10-11 03:35:11,588 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 18 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:11,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1668 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25575 states. [2024-10-11 03:35:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25575 to 25575. [2024-10-11 03:35:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25575 states, 25570 states have (on average 1.3809933515838875) internal successors, (35312), 25574 states have internal predecessors, (35312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25575 states to 25575 states and 35312 transitions. [2024-10-11 03:35:11,995 INFO L78 Accepts]: Start accepts. Automaton has 25575 states and 35312 transitions. Word has length 150 [2024-10-11 03:35:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 25575 states and 35312 transitions. [2024-10-11 03:35:11,995 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) [2024-10-11 03:35:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25575 states and 35312 transitions. [2024-10-11 03:35:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:12,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:12,012 INFO L215 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] [2024-10-11 03:35:12,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:35:12,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:12,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:12,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1046052783, now seen corresponding path program 1 times [2024-10-11 03:35:12,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:12,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367547056] [2024-10-11 03:35:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:12,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367547056] [2024-10-11 03:35:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367547056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:35:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659296331] [2024-10-11 03:35:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:35:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:35:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:35:12,460 INFO L87 Difference]: Start difference. First operand 25575 states and 35312 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 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) [2024-10-11 03:35:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:12,674 INFO L93 Difference]: Finished difference Result 34615 states and 49691 transitions. [2024-10-11 03:35:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 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 [2024-10-11 03:35:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:12,714 INFO L225 Difference]: With dead ends: 34615 [2024-10-11 03:35:12,714 INFO L226 Difference]: Without dead ends: 25577 [2024-10-11 03:35:12,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:35:12,731 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 1894 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:12,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 1244 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25577 states. [2024-10-11 03:35:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25577 to 25575. [2024-10-11 03:35:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25575 states, 25570 states have (on average 1.3746969104419242) internal successors, (35151), 25574 states have internal predecessors, (35151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25575 states to 25575 states and 35151 transitions. [2024-10-11 03:35:13,168 INFO L78 Accepts]: Start accepts. Automaton has 25575 states and 35151 transitions. Word has length 156 [2024-10-11 03:35:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:13,168 INFO L471 AbstractCegarLoop]: Abstraction has 25575 states and 35151 transitions. [2024-10-11 03:35:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 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) [2024-10-11 03:35:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25575 states and 35151 transitions. [2024-10-11 03:35:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:13,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:13,187 INFO L215 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] [2024-10-11 03:35:13,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:35:13,187 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 103448065, now seen corresponding path program 1 times [2024-10-11 03:35:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653970502] [2024-10-11 03:35:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653970502] [2024-10-11 03:35:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653970502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777108653] [2024-10-11 03:35:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:13,587 INFO L87 Difference]: Start difference. First operand 25575 states and 35151 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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) [2024-10-11 03:35:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:13,684 INFO L93 Difference]: Finished difference Result 51035 states and 70149 transitions. [2024-10-11 03:35:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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 [2024-10-11 03:35:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:13,724 INFO L225 Difference]: With dead ends: 51035 [2024-10-11 03:35:13,724 INFO L226 Difference]: Without dead ends: 25575 [2024-10-11 03:35:13,744 INFO L431 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 [2024-10-11 03:35:13,744 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 10 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:13,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1636 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25575 states. [2024-10-11 03:35:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25575 to 25571. [2024-10-11 03:35:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25571 states, 25566 states have (on average 1.3744035046546195) internal successors, (35138), 25570 states have internal predecessors, (35138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25571 states to 25571 states and 35138 transitions. [2024-10-11 03:35:14,147 INFO L78 Accepts]: Start accepts. Automaton has 25571 states and 35138 transitions. Word has length 156 [2024-10-11 03:35:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:14,147 INFO L471 AbstractCegarLoop]: Abstraction has 25571 states and 35138 transitions. [2024-10-11 03:35:14,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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) [2024-10-11 03:35:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 25571 states and 35138 transitions. [2024-10-11 03:35:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:14,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:14,162 INFO L215 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] [2024-10-11 03:35:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:35:14,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -740588820, now seen corresponding path program 1 times [2024-10-11 03:35:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963505057] [2024-10-11 03:35:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963505057] [2024-10-11 03:35:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963505057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165969001] [2024-10-11 03:35:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:14,240 INFO L87 Difference]: Start difference. First operand 25571 states and 35138 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) [2024-10-11 03:35:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:14,393 INFO L93 Difference]: Finished difference Result 73644 states and 100996 transitions. [2024-10-11 03:35:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:14,394 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 [2024-10-11 03:35:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:14,466 INFO L225 Difference]: With dead ends: 73644 [2024-10-11 03:35:14,466 INFO L226 Difference]: Without dead ends: 49390 [2024-10-11 03:35:14,492 INFO L431 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 [2024-10-11 03:35:14,493 INFO L432 NwaCegarLoop]: 992 mSDtfsCounter, 448 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1483 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:14,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1483 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49390 states. [2024-10-11 03:35:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49390 to 49330. [2024-10-11 03:35:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49330 states, 49325 states have (on average 1.3542828180435884) internal successors, (66800), 49329 states have internal predecessors, (66800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49330 states to 49330 states and 66800 transitions. [2024-10-11 03:35:15,349 INFO L78 Accepts]: Start accepts. Automaton has 49330 states and 66800 transitions. Word has length 156 [2024-10-11 03:35:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 49330 states and 66800 transitions. [2024-10-11 03:35:15,350 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) [2024-10-11 03:35:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 49330 states and 66800 transitions. [2024-10-11 03:35:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:15,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:15,387 INFO L215 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] [2024-10-11 03:35:15,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:35:15,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -161795217, now seen corresponding path program 1 times [2024-10-11 03:35:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210631971] [2024-10-11 03:35:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:15,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210631971] [2024-10-11 03:35:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210631971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:15,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:15,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438130173] [2024-10-11 03:35:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:15,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:15,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:15,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:15,762 INFO L87 Difference]: Start difference. First operand 49330 states and 66800 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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) [2024-10-11 03:35:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:16,056 INFO L93 Difference]: Finished difference Result 86088 states and 116608 transitions. [2024-10-11 03:35:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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 [2024-10-11 03:35:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:16,105 INFO L225 Difference]: With dead ends: 86088 [2024-10-11 03:35:16,105 INFO L226 Difference]: Without dead ends: 37915 [2024-10-11 03:35:16,142 INFO L431 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 [2024-10-11 03:35:16,143 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 13 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:16,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1640 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37915 states. [2024-10-11 03:35:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37915 to 37915. [2024-10-11 03:35:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37915 states, 37910 states have (on average 1.3502242152466368) internal successors, (51187), 37914 states have internal predecessors, (51187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37915 states to 37915 states and 51187 transitions. [2024-10-11 03:35:16,700 INFO L78 Accepts]: Start accepts. Automaton has 37915 states and 51187 transitions. Word has length 156 [2024-10-11 03:35:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 37915 states and 51187 transitions. [2024-10-11 03:35:16,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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) [2024-10-11 03:35:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37915 states and 51187 transitions. [2024-10-11 03:35:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:35:16,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:16,719 INFO L215 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] [2024-10-11 03:35:16,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:35:16,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -707511761, now seen corresponding path program 1 times [2024-10-11 03:35:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836317793] [2024-10-11 03:35:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:17,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836317793] [2024-10-11 03:35:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836317793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:17,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:35:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552781475] [2024-10-11 03:35:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:17,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:35:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:35:17,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:35:17,132 INFO L87 Difference]: Start difference. First operand 37915 states and 51187 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:17,364 INFO L93 Difference]: Finished difference Result 70019 states and 97542 transitions. [2024-10-11 03:35:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-11 03:35:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:17,432 INFO L225 Difference]: With dead ends: 70019 [2024-10-11 03:35:17,432 INFO L226 Difference]: Without dead ends: 54933 [2024-10-11 03:35:17,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:35:17,461 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 1859 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:17,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 1186 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54933 states. [2024-10-11 03:35:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54933 to 54931. [2024-10-11 03:35:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54931 states, 54926 states have (on average 1.3445909041255508) internal successors, (73853), 54930 states have internal predecessors, (73853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54931 states to 54931 states and 73853 transitions. [2024-10-11 03:35:18,393 INFO L78 Accepts]: Start accepts. Automaton has 54931 states and 73853 transitions. Word has length 162 [2024-10-11 03:35:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:18,394 INFO L471 AbstractCegarLoop]: Abstraction has 54931 states and 73853 transitions. [2024-10-11 03:35:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54931 states and 73853 transitions. [2024-10-11 03:35:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:35:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:18,432 INFO L215 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] [2024-10-11 03:35:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:35:18,433 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)] === [2024-10-11 03:35:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 571157423, now seen corresponding path program 1 times [2024-10-11 03:35:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256242483] [2024-10-11 03:35:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256242483] [2024-10-11 03:35:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256242483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:18,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:35:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613655167] [2024-10-11 03:35:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:35:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:35:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:35:18,899 INFO L87 Difference]: Start difference. First operand 54931 states and 73853 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:19,265 INFO L93 Difference]: Finished difference Result 102241 states and 137575 transitions. [2024-10-11 03:35:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-11 03:35:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:19,326 INFO L225 Difference]: With dead ends: 102241 [2024-10-11 03:35:19,326 INFO L226 Difference]: Without dead ends: 54931 [2024-10-11 03:35:19,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:35:19,365 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 2840 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:19,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 579 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54931 states. [2024-10-11 03:35:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54931 to 54931. [2024-10-11 03:35:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54931 states, 54926 states have (on average 1.3266940975130175) internal successors, (72870), 54930 states have internal predecessors, (72870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54931 states to 54931 states and 72870 transitions. [2024-10-11 03:35:20,154 INFO L78 Accepts]: Start accepts. Automaton has 54931 states and 72870 transitions. Word has length 162 [2024-10-11 03:35:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:20,154 INFO L471 AbstractCegarLoop]: Abstraction has 54931 states and 72870 transitions. [2024-10-11 03:35:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 54931 states and 72870 transitions. [2024-10-11 03:35:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:35:20,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:20,182 INFO L215 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] [2024-10-11 03:35:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:35:20,182 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)] === [2024-10-11 03:35:20,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1251845622, now seen corresponding path program 1 times [2024-10-11 03:35:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589198934] [2024-10-11 03:35:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589198934] [2024-10-11 03:35:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589198934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:20,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477558224] [2024-10-11 03:35:20,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:20,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:20,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:20,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:20,641 INFO L87 Difference]: Start difference. First operand 54931 states and 72870 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:20,840 INFO L93 Difference]: Finished difference Result 68867 states and 94163 transitions. [2024-10-11 03:35:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-11 03:35:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:20,893 INFO L225 Difference]: With dead ends: 68867 [2024-10-11 03:35:20,893 INFO L226 Difference]: Without dead ends: 48533 [2024-10-11 03:35:20,920 INFO L431 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 [2024-10-11 03:35:20,921 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 587 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:20,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 990 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48533 states. [2024-10-11 03:35:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48533 to 48531. [2024-10-11 03:35:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48531 states, 48526 states have (on average 1.2920496228825784) internal successors, (62698), 48530 states have internal predecessors, (62698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48531 states to 48531 states and 62698 transitions. [2024-10-11 03:35:21,704 INFO L78 Accepts]: Start accepts. Automaton has 48531 states and 62698 transitions. Word has length 162 [2024-10-11 03:35:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:21,705 INFO L471 AbstractCegarLoop]: Abstraction has 48531 states and 62698 transitions. [2024-10-11 03:35:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 48531 states and 62698 transitions. [2024-10-11 03:35:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:35:21,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:21,741 INFO L215 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] [2024-10-11 03:35:21,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:35:21,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash 233212819, now seen corresponding path program 1 times [2024-10-11 03:35:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:21,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300468261] [2024-10-11 03:35:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300468261] [2024-10-11 03:35:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300468261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200876363] [2024-10-11 03:35:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:22,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:22,070 INFO L87 Difference]: Start difference. First operand 48531 states and 62698 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:22,517 INFO L93 Difference]: Finished difference Result 77216 states and 99807 transitions. [2024-10-11 03:35:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-11 03:35:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:22,557 INFO L225 Difference]: With dead ends: 77216 [2024-10-11 03:35:22,557 INFO L226 Difference]: Without dead ends: 43227 [2024-10-11 03:35:22,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:22,574 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 904 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:22,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1018 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2024-10-11 03:35:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 42764. [2024-10-11 03:35:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42764 states, 42759 states have (on average 1.2893192076521902) internal successors, (55130), 42763 states have internal predecessors, (55130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42764 states to 42764 states and 55130 transitions. [2024-10-11 03:35:22,993 INFO L78 Accepts]: Start accepts. Automaton has 42764 states and 55130 transitions. Word has length 162 [2024-10-11 03:35:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:22,993 INFO L471 AbstractCegarLoop]: Abstraction has 42764 states and 55130 transitions. [2024-10-11 03:35:22,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 42764 states and 55130 transitions. [2024-10-11 03:35:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 03:35:23,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:23,017 INFO L215 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] [2024-10-11 03:35:23,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:35:23,017 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1096279487, now seen corresponding path program 1 times [2024-10-11 03:35:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123468016] [2024-10-11 03:35:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123468016] [2024-10-11 03:35:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123468016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914464516] [2024-10-11 03:35:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:23,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:23,430 INFO L87 Difference]: Start difference. First operand 42764 states and 55130 transitions. Second operand has 4 states, 4 states have (on average 41.0) 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) [2024-10-11 03:35:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:23,713 INFO L93 Difference]: Finished difference Result 129144 states and 166292 transitions. [2024-10-11 03:35:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) 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 [2024-10-11 03:35:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:23,806 INFO L225 Difference]: With dead ends: 129144 [2024-10-11 03:35:23,806 INFO L226 Difference]: Without dead ends: 86533 [2024-10-11 03:35:23,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:23,856 INFO L432 NwaCegarLoop]: 873 mSDtfsCounter, 1462 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:23,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 2189 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86533 states. [2024-10-11 03:35:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86533 to 42971. [2024-10-11 03:35:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42971 states, 42966 states have (on average 1.2880184331797235) internal successors, (55341), 42970 states have internal predecessors, (55341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42971 states to 42971 states and 55341 transitions. [2024-10-11 03:35:24,742 INFO L78 Accepts]: Start accepts. Automaton has 42971 states and 55341 transitions. Word has length 164 [2024-10-11 03:35:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 42971 states and 55341 transitions. [2024-10-11 03:35:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) 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) [2024-10-11 03:35:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 42971 states and 55341 transitions. [2024-10-11 03:35:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:35:24,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:24,767 INFO L215 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] [2024-10-11 03:35:24,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:35:24,768 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1087269369, now seen corresponding path program 1 times [2024-10-11 03:35:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381749002] [2024-10-11 03:35:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381749002] [2024-10-11 03:35:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381749002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883653506] [2024-10-11 03:35:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:24,824 INFO L87 Difference]: Start difference. First operand 42971 states and 55341 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) [2024-10-11 03:35:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:24,985 INFO L93 Difference]: Finished difference Result 75114 states and 96767 transitions. [2024-10-11 03:35:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:24,986 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 [2024-10-11 03:35:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:25,036 INFO L225 Difference]: With dead ends: 75114 [2024-10-11 03:35:25,036 INFO L226 Difference]: Without dead ends: 42983 [2024-10-11 03:35:25,063 INFO L431 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 [2024-10-11 03:35:25,064 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:25,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42983 states. [2024-10-11 03:35:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42983 to 42983. [2024-10-11 03:35:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42983 states, 42978 states have (on average 1.2879380147982689) internal successors, (55353), 42982 states have internal predecessors, (55353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42983 states to 42983 states and 55353 transitions. [2024-10-11 03:35:25,993 INFO L78 Accepts]: Start accepts. Automaton has 42983 states and 55353 transitions. Word has length 165 [2024-10-11 03:35:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:25,993 INFO L471 AbstractCegarLoop]: Abstraction has 42983 states and 55353 transitions. [2024-10-11 03:35:25,994 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) [2024-10-11 03:35:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 42983 states and 55353 transitions. [2024-10-11 03:35:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:35:26,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:26,030 INFO L215 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] [2024-10-11 03:35:26,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:35:26,030 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash 812625131, now seen corresponding path program 1 times [2024-10-11 03:35:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179487206] [2024-10-11 03:35:26,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179487206] [2024-10-11 03:35:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179487206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508897887] [2024-10-11 03:35:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:26,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:26,359 INFO L87 Difference]: Start difference. First operand 42983 states and 55353 transitions. Second operand has 4 states, 4 states have (on average 41.5) 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) [2024-10-11 03:35:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:26,822 INFO L93 Difference]: Finished difference Result 86385 states and 111176 transitions. [2024-10-11 03:35:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) 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 [2024-10-11 03:35:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:26,866 INFO L225 Difference]: With dead ends: 86385 [2024-10-11 03:35:26,867 INFO L226 Difference]: Without dead ends: 43834 [2024-10-11 03:35:26,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:26,891 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 456 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:26,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 2154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43834 states. [2024-10-11 03:35:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43834 to 43297. [2024-10-11 03:35:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43297 states, 43292 states have (on average 1.2864963503649636) internal successors, (55695), 43296 states have internal predecessors, (55695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43297 states to 43297 states and 55695 transitions. [2024-10-11 03:35:27,336 INFO L78 Accepts]: Start accepts. Automaton has 43297 states and 55695 transitions. Word has length 166 [2024-10-11 03:35:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:27,336 INFO L471 AbstractCegarLoop]: Abstraction has 43297 states and 55695 transitions. [2024-10-11 03:35:27,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) 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) [2024-10-11 03:35:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 43297 states and 55695 transitions. [2024-10-11 03:35:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:35:27,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:27,362 INFO L215 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] [2024-10-11 03:35:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:35:27,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:27,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1901070816, now seen corresponding path program 1 times [2024-10-11 03:35:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558944976] [2024-10-11 03:35:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558944976] [2024-10-11 03:35:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558944976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870841753] [2024-10-11 03:35:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:27,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:27,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:27,749 INFO L87 Difference]: Start difference. First operand 43297 states and 55695 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) [2024-10-11 03:35:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:27,870 INFO L93 Difference]: Finished difference Result 61954 states and 79652 transitions. [2024-10-11 03:35:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:27,870 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 [2024-10-11 03:35:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:27,909 INFO L225 Difference]: With dead ends: 61954 [2024-10-11 03:35:27,910 INFO L226 Difference]: Without dead ends: 37378 [2024-10-11 03:35:27,933 INFO L431 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 [2024-10-11 03:35:27,934 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:27,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1579 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37378 states. [2024-10-11 03:35:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37378 to 37375. [2024-10-11 03:35:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37375 states, 37370 states have (on average 1.2865667647845866) internal successors, (48079), 37374 states have internal predecessors, (48079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37375 states to 37375 states and 48079 transitions. [2024-10-11 03:35:28,329 INFO L78 Accepts]: Start accepts. Automaton has 37375 states and 48079 transitions. Word has length 166 [2024-10-11 03:35:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:28,329 INFO L471 AbstractCegarLoop]: Abstraction has 37375 states and 48079 transitions. [2024-10-11 03:35:28,329 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) [2024-10-11 03:35:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37375 states and 48079 transitions. [2024-10-11 03:35:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:28,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:28,352 INFO L215 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] [2024-10-11 03:35:28,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:35:28,352 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:28,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash 948344565, now seen corresponding path program 1 times [2024-10-11 03:35:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144939040] [2024-10-11 03:35:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144939040] [2024-10-11 03:35:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144939040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:28,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:28,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286777497] [2024-10-11 03:35:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:28,489 INFO L87 Difference]: Start difference. First operand 37375 states and 48079 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:28,786 INFO L93 Difference]: Finished difference Result 91953 states and 119793 transitions. [2024-10-11 03:35:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:28,855 INFO L225 Difference]: With dead ends: 91953 [2024-10-11 03:35:28,855 INFO L226 Difference]: Without dead ends: 66739 [2024-10-11 03:35:28,886 INFO L431 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 [2024-10-11 03:35:28,887 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 334 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:28,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 966 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66739 states. [2024-10-11 03:35:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66739 to 65856. [2024-10-11 03:35:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65856 states, 65851 states have (on average 1.283868126528071) internal successors, (84544), 65855 states have internal predecessors, (84544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65856 states to 65856 states and 84544 transitions. [2024-10-11 03:35:29,703 INFO L78 Accepts]: Start accepts. Automaton has 65856 states and 84544 transitions. Word has length 168 [2024-10-11 03:35:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 65856 states and 84544 transitions. [2024-10-11 03:35:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 65856 states and 84544 transitions. [2024-10-11 03:35:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:29,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:29,738 INFO L215 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] [2024-10-11 03:35:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:35:29,739 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:29,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1612624048, now seen corresponding path program 1 times [2024-10-11 03:35:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482794723] [2024-10-11 03:35:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482794723] [2024-10-11 03:35:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482794723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:35:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790025381] [2024-10-11 03:35:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:30,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:35:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:30,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:35:30,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:35:30,494 INFO L87 Difference]: Start difference. First operand 65856 states and 84544 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:31,783 INFO L93 Difference]: Finished difference Result 114101 states and 146822 transitions. [2024-10-11 03:35:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:35:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:31,918 INFO L225 Difference]: With dead ends: 114101 [2024-10-11 03:35:31,919 INFO L226 Difference]: Without dead ends: 101480 [2024-10-11 03:35:31,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:35:31,968 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 3361 mSDsluCounter, 7623 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3361 SdHoareTripleChecker+Valid, 8403 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:31,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3361 Valid, 8403 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:35:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101480 states. [2024-10-11 03:35:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101480 to 78254. [2024-10-11 03:35:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78254 states, 78249 states have (on average 1.2605656302316963) internal successors, (98638), 78253 states have internal predecessors, (98638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78254 states to 78254 states and 98638 transitions. [2024-10-11 03:35:33,357 INFO L78 Accepts]: Start accepts. Automaton has 78254 states and 98638 transitions. Word has length 168 [2024-10-11 03:35:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 78254 states and 98638 transitions. [2024-10-11 03:35:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 78254 states and 98638 transitions. [2024-10-11 03:35:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:33,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:33,407 INFO L215 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] [2024-10-11 03:35:33,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:35:33,408 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -707025626, now seen corresponding path program 1 times [2024-10-11 03:35:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632604717] [2024-10-11 03:35:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632604717] [2024-10-11 03:35:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632604717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:35:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845990068] [2024-10-11 03:35:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:35:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:35:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:35:34,314 INFO L87 Difference]: Start difference. First operand 78254 states and 98638 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,481 INFO L93 Difference]: Finished difference Result 108925 states and 138773 transitions. [2024-10-11 03:35:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:35:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,593 INFO L225 Difference]: With dead ends: 108925 [2024-10-11 03:35:35,593 INFO L226 Difference]: Without dead ends: 98719 [2024-10-11 03:35:35,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:35:35,632 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 4310 mSDsluCounter, 6077 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4310 SdHoareTripleChecker+Valid, 6838 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:35,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4310 Valid, 6838 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:35:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98719 states. [2024-10-11 03:35:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98719 to 89776. [2024-10-11 03:35:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89776 states, 89771 states have (on average 1.2477080571676822) internal successors, (112008), 89775 states have internal predecessors, (112008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89776 states to 89776 states and 112008 transitions. [2024-10-11 03:35:37,031 INFO L78 Accepts]: Start accepts. Automaton has 89776 states and 112008 transitions. Word has length 168 [2024-10-11 03:35:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 89776 states and 112008 transitions. [2024-10-11 03:35:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 89776 states and 112008 transitions. [2024-10-11 03:35:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:37,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:37,112 INFO L215 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] [2024-10-11 03:35:37,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:35:37,112 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:37,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash -64218961, now seen corresponding path program 1 times [2024-10-11 03:35:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037941864] [2024-10-11 03:35:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037941864] [2024-10-11 03:35:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037941864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:35:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098124259] [2024-10-11 03:35:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:35:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:35:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:35:37,921 INFO L87 Difference]: Start difference. First operand 89776 states and 112008 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:39,856 INFO L93 Difference]: Finished difference Result 177092 states and 228809 transitions. [2024-10-11 03:35:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:35:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:40,048 INFO L225 Difference]: With dead ends: 177092 [2024-10-11 03:35:40,049 INFO L226 Difference]: Without dead ends: 167365 [2024-10-11 03:35:40,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=1228, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:35:40,108 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 5642 mSDsluCounter, 7016 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5642 SdHoareTripleChecker+Valid, 7731 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:40,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5642 Valid, 7731 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:35:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167365 states. [2024-10-11 03:35:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167365 to 108385. [2024-10-11 03:35:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108385 states, 108380 states have (on average 1.2346281601771545) internal successors, (133809), 108384 states have internal predecessors, (133809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108385 states to 108385 states and 133809 transitions. [2024-10-11 03:35:42,329 INFO L78 Accepts]: Start accepts. Automaton has 108385 states and 133809 transitions. Word has length 168 [2024-10-11 03:35:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:42,329 INFO L471 AbstractCegarLoop]: Abstraction has 108385 states and 133809 transitions. [2024-10-11 03:35:42,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108385 states and 133809 transitions. [2024-10-11 03:35:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:42,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:42,402 INFO L215 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] [2024-10-11 03:35:42,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:35:42,402 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:42,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -414146209, now seen corresponding path program 1 times [2024-10-11 03:35:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543534878] [2024-10-11 03:35:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:44,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543534878] [2024-10-11 03:35:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543534878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:35:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632855609] [2024-10-11 03:35:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:44,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:35:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:35:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:35:44,364 INFO L87 Difference]: Start difference. First operand 108385 states and 133809 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:48,044 INFO L93 Difference]: Finished difference Result 146918 states and 183845 transitions. [2024-10-11 03:35:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 03:35:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:48,193 INFO L225 Difference]: With dead ends: 146918 [2024-10-11 03:35:48,193 INFO L226 Difference]: Without dead ends: 141968 [2024-10-11 03:35:48,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=427, Invalid=2329, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 03:35:48,242 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 3257 mSDsluCounter, 12330 mSDsCounter, 0 mSdLazyCounter, 4429 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3257 SdHoareTripleChecker+Valid, 13119 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:48,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3257 Valid, 13119 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4429 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 03:35:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141968 states. [2024-10-11 03:35:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141968 to 113017. [2024-10-11 03:35:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113017 states, 113012 states have (on average 1.2319842140657629) internal successors, (139229), 113016 states have internal predecessors, (139229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113017 states to 113017 states and 139229 transitions. [2024-10-11 03:35:50,075 INFO L78 Accepts]: Start accepts. Automaton has 113017 states and 139229 transitions. Word has length 168 [2024-10-11 03:35:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:50,075 INFO L471 AbstractCegarLoop]: Abstraction has 113017 states and 139229 transitions. [2024-10-11 03:35:50,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 113017 states and 139229 transitions. [2024-10-11 03:35:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:50,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:50,152 INFO L215 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] [2024-10-11 03:35:50,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:35:50,152 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2102488286, now seen corresponding path program 1 times [2024-10-11 03:35:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069580176] [2024-10-11 03:35:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069580176] [2024-10-11 03:35:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069580176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:50,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:50,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:35:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356840845] [2024-10-11 03:35:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:35:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:35:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:35:50,415 INFO L87 Difference]: Start difference. First operand 113017 states and 139229 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:51,205 INFO L93 Difference]: Finished difference Result 176034 states and 219071 transitions. [2024-10-11 03:35:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:51,302 INFO L225 Difference]: With dead ends: 176034 [2024-10-11 03:35:51,302 INFO L226 Difference]: Without dead ends: 80346 [2024-10-11 03:35:51,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:35:51,363 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1484 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:51,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 612 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80346 states. [2024-10-11 03:35:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80346 to 72144. [2024-10-11 03:35:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72144 states, 72139 states have (on average 1.2137817269438167) internal successors, (87561), 72143 states have internal predecessors, (87561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72144 states to 72144 states and 87561 transitions. [2024-10-11 03:35:52,564 INFO L78 Accepts]: Start accepts. Automaton has 72144 states and 87561 transitions. Word has length 168 [2024-10-11 03:35:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 72144 states and 87561 transitions. [2024-10-11 03:35:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 72144 states and 87561 transitions. [2024-10-11 03:35:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:52,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:52,617 INFO L215 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] [2024-10-11 03:35:52,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:35:52,617 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:52,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1528199527, now seen corresponding path program 1 times [2024-10-11 03:35:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526359133] [2024-10-11 03:35:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526359133] [2024-10-11 03:35:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526359133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-11 03:35:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859092147] [2024-10-11 03:35:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:54,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:35:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:35:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:35:54,781 INFO L87 Difference]: Start difference. First operand 72144 states and 87561 transitions. Second operand has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:58,233 INFO L93 Difference]: Finished difference Result 83541 states and 102862 transitions. [2024-10-11 03:35:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:35:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:35:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:58,385 INFO L225 Difference]: With dead ends: 83541 [2024-10-11 03:35:58,385 INFO L226 Difference]: Without dead ends: 80992 [2024-10-11 03:35:58,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=1897, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 03:35:58,400 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 2820 mSDsluCounter, 13405 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2820 SdHoareTripleChecker+Valid, 14197 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:58,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2820 Valid, 14197 Invalid, 4961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4936 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 03:35:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80992 states. [2024-10-11 03:35:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80992 to 72937. [2024-10-11 03:35:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72937 states, 72932 states have (on average 1.2130477705259695) internal successors, (88470), 72936 states have internal predecessors, (88470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72937 states to 72937 states and 88470 transitions. [2024-10-11 03:35:59,496 INFO L78 Accepts]: Start accepts. Automaton has 72937 states and 88470 transitions. Word has length 168 [2024-10-11 03:35:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:59,496 INFO L471 AbstractCegarLoop]: Abstraction has 72937 states and 88470 transitions. [2024-10-11 03:35:59,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72937 states and 88470 transitions. [2024-10-11 03:35:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:59,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:59,551 INFO L215 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] [2024-10-11 03:35:59,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:35:59,551 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:59,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 660214958, now seen corresponding path program 1 times [2024-10-11 03:35:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752507563] [2024-10-11 03:35:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752507563] [2024-10-11 03:36:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752507563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:36:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673703764] [2024-10-11 03:36:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:01,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:36:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:36:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:36:01,097 INFO L87 Difference]: Start difference. First operand 72937 states and 88470 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:05,375 INFO L93 Difference]: Finished difference Result 101259 states and 126697 transitions. [2024-10-11 03:36:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:36:05,376 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-11 03:36:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:05,469 INFO L225 Difference]: With dead ends: 101259 [2024-10-11 03:36:05,469 INFO L226 Difference]: Without dead ends: 98007 [2024-10-11 03:36:05,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=471, Invalid=1599, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 03:36:05,493 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 4160 mSDsluCounter, 11248 mSDsCounter, 0 mSdLazyCounter, 4579 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4160 SdHoareTripleChecker+Valid, 12048 SdHoareTripleChecker+Invalid, 4662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:05,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4160 Valid, 12048 Invalid, 4662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4579 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 03:36:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98007 states. [2024-10-11 03:36:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98007 to 75625. [2024-10-11 03:36:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75625 states, 75620 states have (on average 1.2103015075376884) internal successors, (91523), 75624 states have internal predecessors, (91523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75625 states to 75625 states and 91523 transitions. [2024-10-11 03:36:06,570 INFO L78 Accepts]: Start accepts. Automaton has 75625 states and 91523 transitions. Word has length 168 [2024-10-11 03:36:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 75625 states and 91523 transitions. [2024-10-11 03:36:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 22 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 75625 states and 91523 transitions. [2024-10-11 03:36:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:36:06,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:06,626 INFO L215 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] [2024-10-11 03:36:06,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:36:06,626 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1380597043, now seen corresponding path program 1 times [2024-10-11 03:36:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630751579] [2024-10-11 03:36:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat