./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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-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 b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:51:10,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:51:10,530 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:51:10,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:51:10,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:51:10,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:51:10,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:51:10,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:51:10,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:51:10,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:51:10,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:51:10,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:51:10,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:51:10,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:51:10,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:51:10,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:51:10,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:51:10,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:51:10,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:51:10,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:51:10,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:51:10,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:51:10,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:51:10,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:51:10,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:51:10,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:51:10,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:51:10,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:51:10,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:51:10,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:51:10,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:51:10,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:51:10,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:10,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:51:10,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:51:10,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:51:10,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:51:10,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:51:10,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:51:10,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:51:10,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:51:10,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:51:10,595 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 -> b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c [2024-10-11 03:51:10,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:51:10,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:51:10,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:51:10,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:51:10,917 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:51:10,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:51:12,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:51:12,888 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:51:12,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:51:12,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9a565c8d/be5e39efa3ad4aed9bceb4e279b957fb/FLAG75c8947d1 [2024-10-11 03:51:12,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9a565c8d/be5e39efa3ad4aed9bceb4e279b957fb [2024-10-11 03:51:12,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:51:12,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:51:12,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:12,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:51:12,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:51:12,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:12" (1/1) ... [2024-10-11 03:51:12,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f8e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:12, skipping insertion in model container [2024-10-11 03:51:12,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:12" (1/1) ... [2024-10-11 03:51:13,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:51:14,019 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2024-10-11 03:51:14,172 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2024-10-11 03:51:14,214 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2024-10-11 03:51:14,235 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2024-10-11 03:51:14,248 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2024-10-11 03:51:14,262 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2024-10-11 03:51:14,333 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2024-10-11 03:51:14,369 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2024-10-11 03:51:14,393 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2024-10-11 03:51:14,404 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2024-10-11 03:51:14,415 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2024-10-11 03:51:14,456 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2024-10-11 03:51:14,474 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2024-10-11 03:51:14,489 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2024-10-11 03:51:14,499 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2024-10-11 03:51:14,511 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2024-10-11 03:51:14,521 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2024-10-11 03:51:14,531 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2024-10-11 03:51:14,541 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2024-10-11 03:51:14,552 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2024-10-11 03:51:14,562 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2024-10-11 03:51:14,573 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2024-10-11 03:51:14,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:14,642 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:51:14,883 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2024-10-11 03:51:14,941 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2024-10-11 03:51:15,006 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2024-10-11 03:51:15,022 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2024-10-11 03:51:15,030 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2024-10-11 03:51:15,039 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2024-10-11 03:51:15,137 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2024-10-11 03:51:15,173 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2024-10-11 03:51:15,193 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2024-10-11 03:51:15,202 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2024-10-11 03:51:15,210 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2024-10-11 03:51:15,244 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2024-10-11 03:51:15,260 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2024-10-11 03:51:15,269 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2024-10-11 03:51:15,279 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2024-10-11 03:51:15,289 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2024-10-11 03:51:15,297 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2024-10-11 03:51:15,305 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2024-10-11 03:51:15,313 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2024-10-11 03:51:15,323 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2024-10-11 03:51:15,332 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2024-10-11 03:51:15,341 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_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2024-10-11 03:51:15,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:15,399 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:51:15,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15 WrapperNode [2024-10-11 03:51:15,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:15,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:15,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:51:15,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:51:15,409 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:51:15" (1/1) ... [2024-10-11 03:51:15,482 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:51:15" (1/1) ... [2024-10-11 03:51:15,674 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12202 [2024-10-11 03:51:15,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:15,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:51:15,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:51:15,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:51:15,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:15,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:15,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:15,912 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:51:15,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:15,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:51:16,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:51:16,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:51:16,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:51:16,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (1/1) ... [2024-10-11 03:51:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:51:16,246 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:51:16,249 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:51:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:51:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:51:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:51:16,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:51:16,661 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:51:16,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:51:22,002 INFO L? ?]: Removed 2222 outVars from TransFormulas that were not future-live. [2024-10-11 03:51:22,002 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:51:22,123 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:51:22,124 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:51:22,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:22 BoogieIcfgContainer [2024-10-11 03:51:22,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:51:22,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:51:22,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:51:22,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:51:22,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:51:12" (1/3) ... [2024-10-11 03:51:22,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ebe784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:22, skipping insertion in model container [2024-10-11 03:51:22,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:15" (2/3) ... [2024-10-11 03:51:22,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ebe784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:22, skipping insertion in model container [2024-10-11 03:51:22,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:22" (3/3) ... [2024-10-11 03:51:22,133 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:51:22,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:51:22,150 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 03:51:22,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:51:22,282 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;@34c46496, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:51:22,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 03:51:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 2346 states, 2323 states have (on average 1.8222126560482135) internal successors, (4233), 2345 states have internal predecessors, (4233), 0 states have call successors, (0), 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:51:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:51:22,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:22,354 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] [2024-10-11 03:51:22,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash 474104121, now seen corresponding path program 1 times [2024-10-11 03:51:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203945188] [2024-10-11 03:51:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:22,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:23,148 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:51:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203945188] [2024-10-11 03:51:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203945188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487998951] [2024-10-11 03:51:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:23,201 INFO L87 Difference]: Start difference. First operand has 2346 states, 2323 states have (on average 1.8222126560482135) internal successors, (4233), 2345 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:24,944 INFO L93 Difference]: Finished difference Result 2799 states and 4973 transitions. [2024-10-11 03:51:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:51:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:24,980 INFO L225 Difference]: With dead ends: 2799 [2024-10-11 03:51:24,980 INFO L226 Difference]: Without dead ends: 1620 [2024-10-11 03:51:24,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:24,994 INFO L432 NwaCegarLoop]: 1527 mSDtfsCounter, 8452 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8452 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:24,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8452 Valid, 1567 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:51:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-10-11 03:51:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2024-10-11 03:51:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1598 states have (on average 1.3222778473091363) internal successors, (2113), 1619 states have internal predecessors, (2113), 0 states have call successors, (0), 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:51:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2113 transitions. [2024-10-11 03:51:25,119 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2113 transitions. Word has length 85 [2024-10-11 03:51:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:25,120 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2113 transitions. [2024-10-11 03:51:25,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2113 transitions. [2024-10-11 03:51:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:51:25,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:25,126 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] [2024-10-11 03:51:25,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:51:25,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:25,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1379625602, now seen corresponding path program 1 times [2024-10-11 03:51:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676315633] [2024-10-11 03:51:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:25,437 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:51:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676315633] [2024-10-11 03:51:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676315633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007417431] [2024-10-11 03:51:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:25,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:25,441 INFO L87 Difference]: Start difference. First operand 1620 states and 2113 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:26,688 INFO L93 Difference]: Finished difference Result 2275 states and 2992 transitions. [2024-10-11 03:51:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:26,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:51:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:26,694 INFO L225 Difference]: With dead ends: 2275 [2024-10-11 03:51:26,695 INFO L226 Difference]: Without dead ends: 1492 [2024-10-11 03:51:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:26,699 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 5770 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5770 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:26,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5770 Valid, 846 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:51:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-10-11 03:51:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2024-10-11 03:51:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1470 states have (on average 1.3387755102040817) internal successors, (1968), 1491 states have internal predecessors, (1968), 0 states have call successors, (0), 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:51:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1968 transitions. [2024-10-11 03:51:26,736 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1968 transitions. Word has length 85 [2024-10-11 03:51:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1968 transitions. [2024-10-11 03:51:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1968 transitions. [2024-10-11 03:51:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:51:26,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:26,745 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] [2024-10-11 03:51:26,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:51:26,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -546397045, now seen corresponding path program 1 times [2024-10-11 03:51:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089197247] [2024-10-11 03:51:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:26,966 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:51:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089197247] [2024-10-11 03:51:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089197247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411982589] [2024-10-11 03:51:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:26,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:26,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:26,971 INFO L87 Difference]: Start difference. First operand 1492 states and 1968 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:28,006 INFO L93 Difference]: Finished difference Result 2019 states and 2670 transitions. [2024-10-11 03:51:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:51:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:28,013 INFO L225 Difference]: With dead ends: 2019 [2024-10-11 03:51:28,013 INFO L226 Difference]: Without dead ends: 1252 [2024-10-11 03:51:28,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:28,016 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 4945 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4945 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:28,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4945 Valid, 776 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-10-11 03:51:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2024-10-11 03:51:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1230 states have (on average 1.3585365853658538) internal successors, (1671), 1251 states have internal predecessors, (1671), 0 states have call successors, (0), 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:51:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1671 transitions. [2024-10-11 03:51:28,047 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1671 transitions. Word has length 85 [2024-10-11 03:51:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:28,047 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1671 transitions. [2024-10-11 03:51:28,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1671 transitions. [2024-10-11 03:51:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:51:28,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:28,052 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] [2024-10-11 03:51:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:51:28,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 828162727, now seen corresponding path program 1 times [2024-10-11 03:51:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932169665] [2024-10-11 03:51:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:28,246 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:51:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932169665] [2024-10-11 03:51:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932169665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:28,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:28,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318341303] [2024-10-11 03:51:28,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:28,253 INFO L87 Difference]: Start difference. First operand 1252 states and 1671 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:29,041 INFO L93 Difference]: Finished difference Result 1818 states and 2439 transitions. [2024-10-11 03:51:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 03:51:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:29,046 INFO L225 Difference]: With dead ends: 1818 [2024-10-11 03:51:29,046 INFO L226 Difference]: Without dead ends: 1161 [2024-10-11 03:51:29,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:29,048 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 4635 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:29,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 735 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-11 03:51:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2024-10-11 03:51:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1139 states have (on average 1.3722563652326603) internal successors, (1563), 1160 states have internal predecessors, (1563), 0 states have call successors, (0), 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:51:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1563 transitions. [2024-10-11 03:51:29,080 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1563 transitions. Word has length 86 [2024-10-11 03:51:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:29,081 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1563 transitions. [2024-10-11 03:51:29,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1563 transitions. [2024-10-11 03:51:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:51:29,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:29,084 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] [2024-10-11 03:51:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:51:29,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash -379387896, now seen corresponding path program 1 times [2024-10-11 03:51:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708261757] [2024-10-11 03:51:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:29,282 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:51:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708261757] [2024-10-11 03:51:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708261757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147440419] [2024-10-11 03:51:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:29,286 INFO L87 Difference]: Start difference. First operand 1161 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:29,838 INFO L93 Difference]: Finished difference Result 1480 states and 1959 transitions. [2024-10-11 03:51:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 03:51:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:29,842 INFO L225 Difference]: With dead ends: 1480 [2024-10-11 03:51:29,842 INFO L226 Difference]: Without dead ends: 896 [2024-10-11 03:51:29,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:29,844 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 3516 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3516 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:29,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3516 Valid, 590 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:51:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-11 03:51:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-11 03:51:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 874 states have (on average 1.3787185354691076) internal successors, (1205), 895 states have internal predecessors, (1205), 0 states have call successors, (0), 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:51:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1205 transitions. [2024-10-11 03:51:29,859 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1205 transitions. Word has length 87 [2024-10-11 03:51:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1205 transitions. [2024-10-11 03:51:29,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1205 transitions. [2024-10-11 03:51:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:51:29,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:29,862 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] [2024-10-11 03:51:29,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:51:29,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:29,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -211366857, now seen corresponding path program 1 times [2024-10-11 03:51:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057800951] [2024-10-11 03:51:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:30,008 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:51:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057800951] [2024-10-11 03:51:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057800951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:30,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:30,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778396182] [2024-10-11 03:51:30,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:30,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:30,011 INFO L87 Difference]: Start difference. First operand 896 states and 1205 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:30,409 INFO L93 Difference]: Finished difference Result 1085 states and 1422 transitions. [2024-10-11 03:51:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:30,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 03:51:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:30,415 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 03:51:30,415 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 03:51:30,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:30,417 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 2443 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:30,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2443 Valid, 468 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:51:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 03:51:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2024-10-11 03:51:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.383739837398374) internal successors, (851), 636 states have internal predecessors, (851), 0 states have call successors, (0), 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:51:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 851 transitions. [2024-10-11 03:51:30,429 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 851 transitions. Word has length 88 [2024-10-11 03:51:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 851 transitions. [2024-10-11 03:51:30,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 851 transitions. [2024-10-11 03:51:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:30,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:30,431 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] [2024-10-11 03:51:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:51:30,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:30,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 328508839, now seen corresponding path program 1 times [2024-10-11 03:51:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855991631] [2024-10-11 03:51:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:31,071 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:51:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855991631] [2024-10-11 03:51:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855991631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196292066] [2024-10-11 03:51:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:31,074 INFO L87 Difference]: Start difference. First operand 637 states and 851 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:32,452 INFO L93 Difference]: Finished difference Result 1088 states and 1462 transitions. [2024-10-11 03:51:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:51:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 03:51:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:32,456 INFO L225 Difference]: With dead ends: 1088 [2024-10-11 03:51:32,456 INFO L226 Difference]: Without dead ends: 989 [2024-10-11 03:51:32,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:51:32,457 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 3597 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3597 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:32,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3597 Valid, 2751 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:51:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-11 03:51:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 644. [2024-10-11 03:51:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3842443729903537) internal successors, (861), 643 states have internal predecessors, (861), 0 states have call successors, (0), 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:51:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 861 transitions. [2024-10-11 03:51:32,474 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 861 transitions. Word has length 89 [2024-10-11 03:51:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:32,475 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 861 transitions. [2024-10-11 03:51:32,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 861 transitions. [2024-10-11 03:51:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:32,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:32,476 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] [2024-10-11 03:51:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:51:32,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1518979119, now seen corresponding path program 1 times [2024-10-11 03:51:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663233839] [2024-10-11 03:51:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:33,026 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:51:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663233839] [2024-10-11 03:51:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663233839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:33,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840346344] [2024-10-11 03:51:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:33,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:33,030 INFO L87 Difference]: Start difference. First operand 644 states and 861 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:34,517 INFO L93 Difference]: Finished difference Result 1128 states and 1522 transitions. [2024-10-11 03:51:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:51:34,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 03:51:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:34,525 INFO L225 Difference]: With dead ends: 1128 [2024-10-11 03:51:34,526 INFO L226 Difference]: Without dead ends: 990 [2024-10-11 03:51:34,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:51:34,527 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 3046 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3046 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:34,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3046 Valid, 2529 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:51:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-11 03:51:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 644. [2024-10-11 03:51:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.382636655948553) internal successors, (860), 643 states have internal predecessors, (860), 0 states have call successors, (0), 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:51:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 860 transitions. [2024-10-11 03:51:34,545 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 860 transitions. Word has length 89 [2024-10-11 03:51:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:34,547 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 860 transitions. [2024-10-11 03:51:34,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 860 transitions. [2024-10-11 03:51:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:34,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:34,549 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] [2024-10-11 03:51:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:51:34,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1669555108, now seen corresponding path program 1 times [2024-10-11 03:51:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144844365] [2024-10-11 03:51:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:34,977 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:51:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144844365] [2024-10-11 03:51:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144844365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759871222] [2024-10-11 03:51:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:34,981 INFO L87 Difference]: Start difference. First operand 644 states and 860 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:36,190 INFO L93 Difference]: Finished difference Result 938 states and 1228 transitions. [2024-10-11 03:51:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:36,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 03:51:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:36,195 INFO L225 Difference]: With dead ends: 938 [2024-10-11 03:51:36,195 INFO L226 Difference]: Without dead ends: 933 [2024-10-11 03:51:36,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:36,196 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 3490 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:36,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 1863 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-10-11 03:51:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 644. [2024-10-11 03:51:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3810289389067525) internal successors, (859), 643 states have internal predecessors, (859), 0 states have call successors, (0), 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:51:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 859 transitions. [2024-10-11 03:51:36,212 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 859 transitions. Word has length 89 [2024-10-11 03:51:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 859 transitions. [2024-10-11 03:51:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 859 transitions. [2024-10-11 03:51:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:36,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:36,215 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] [2024-10-11 03:51:36,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:51:36,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash 231777635, now seen corresponding path program 1 times [2024-10-11 03:51:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432223978] [2024-10-11 03:51:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:36,650 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:51:36,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:36,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432223978] [2024-10-11 03:51:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432223978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:51:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430152694] [2024-10-11 03:51:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:51:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:51:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:36,653 INFO L87 Difference]: Start difference. First operand 644 states and 859 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:37,685 INFO L93 Difference]: Finished difference Result 1207 states and 1569 transitions. [2024-10-11 03:51:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:51:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 03:51:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:37,689 INFO L225 Difference]: With dead ends: 1207 [2024-10-11 03:51:37,689 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 03:51:37,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:51:37,690 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 2869 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2869 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:37,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2869 Valid, 1388 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 03:51:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 644. [2024-10-11 03:51:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3794212218649518) internal successors, (858), 643 states have internal predecessors, (858), 0 states have call successors, (0), 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:51:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 858 transitions. [2024-10-11 03:51:37,705 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 858 transitions. Word has length 89 [2024-10-11 03:51:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:37,705 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 858 transitions. [2024-10-11 03:51:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 858 transitions. [2024-10-11 03:51:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:37,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:37,707 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] [2024-10-11 03:51:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:51:37,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1427714440, now seen corresponding path program 1 times [2024-10-11 03:51:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:37,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344829534] [2024-10-11 03:51:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:38,191 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:51:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344829534] [2024-10-11 03:51:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344829534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212582252] [2024-10-11 03:51:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:38,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:38,194 INFO L87 Difference]: Start difference. First operand 644 states and 858 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:39,197 INFO L93 Difference]: Finished difference Result 938 states and 1225 transitions. [2024-10-11 03:51:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:39,200 INFO L225 Difference]: With dead ends: 938 [2024-10-11 03:51:39,200 INFO L226 Difference]: Without dead ends: 933 [2024-10-11 03:51:39,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:39,202 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 2307 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:39,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 1863 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-10-11 03:51:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 644. [2024-10-11 03:51:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3778135048231512) internal successors, (857), 643 states have internal predecessors, (857), 0 states have call successors, (0), 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:51:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2024-10-11 03:51:39,216 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 91 [2024-10-11 03:51:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2024-10-11 03:51:39,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2024-10-11 03:51:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:39,218 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] [2024-10-11 03:51:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:51:39,218 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1221078273, now seen corresponding path program 1 times [2024-10-11 03:51:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989675181] [2024-10-11 03:51:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:39,577 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:51:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989675181] [2024-10-11 03:51:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989675181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:39,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:39,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611317633] [2024-10-11 03:51:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:39,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:39,580 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:40,619 INFO L93 Difference]: Finished difference Result 1126 states and 1513 transitions. [2024-10-11 03:51:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:40,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:40,622 INFO L225 Difference]: With dead ends: 1126 [2024-10-11 03:51:40,623 INFO L226 Difference]: Without dead ends: 988 [2024-10-11 03:51:40,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:40,624 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 2574 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:40,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 2629 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-11 03:51:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 644. [2024-10-11 03:51:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3762057877813505) internal successors, (856), 643 states have internal predecessors, (856), 0 states have call successors, (0), 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:51:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 856 transitions. [2024-10-11 03:51:40,636 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 856 transitions. Word has length 91 [2024-10-11 03:51:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 856 transitions. [2024-10-11 03:51:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 856 transitions. [2024-10-11 03:51:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:40,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:40,638 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] [2024-10-11 03:51:40,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:51:40,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash -982216986, now seen corresponding path program 1 times [2024-10-11 03:51:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665197009] [2024-10-11 03:51:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:41,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:51:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665197009] [2024-10-11 03:51:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665197009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:51:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568238448] [2024-10-11 03:51:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:51:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:51:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:51:41,166 INFO L87 Difference]: Start difference. First operand 644 states and 856 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:42,829 INFO L93 Difference]: Finished difference Result 1309 states and 1760 transitions. [2024-10-11 03:51:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:51:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:42,832 INFO L225 Difference]: With dead ends: 1309 [2024-10-11 03:51:42,832 INFO L226 Difference]: Without dead ends: 1087 [2024-10-11 03:51:42,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:51:42,833 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 2966 mSDsluCounter, 3639 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2966 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 3491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:42,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2966 Valid, 4347 Invalid, 3491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:51:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-11 03:51:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 644. [2024-10-11 03:51:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3745980707395498) internal successors, (855), 643 states have internal predecessors, (855), 0 states have call successors, (0), 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:51:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 855 transitions. [2024-10-11 03:51:42,845 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 855 transitions. Word has length 91 [2024-10-11 03:51:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 855 transitions. [2024-10-11 03:51:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 855 transitions. [2024-10-11 03:51:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:42,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:42,847 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] [2024-10-11 03:51:42,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:51:42,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:42,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash -867898654, now seen corresponding path program 1 times [2024-10-11 03:51:42,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:42,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694500239] [2024-10-11 03:51:42,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:42,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:43,181 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:51:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694500239] [2024-10-11 03:51:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694500239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250200217] [2024-10-11 03:51:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:43,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:43,184 INFO L87 Difference]: Start difference. First operand 644 states and 855 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,598 INFO L93 Difference]: Finished difference Result 1178 states and 1582 transitions. [2024-10-11 03:51:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,602 INFO L225 Difference]: With dead ends: 1178 [2024-10-11 03:51:44,602 INFO L226 Difference]: Without dead ends: 986 [2024-10-11 03:51:44,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:44,603 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 2567 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 3577 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:51:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-10-11 03:51:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 637. [2024-10-11 03:51:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3739837398373984) internal successors, (845), 636 states have internal predecessors, (845), 0 states have call successors, (0), 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:51:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 845 transitions. [2024-10-11 03:51:44,615 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 845 transitions. Word has length 91 [2024-10-11 03:51:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 845 transitions. [2024-10-11 03:51:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 845 transitions. [2024-10-11 03:51:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:44,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,618 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] [2024-10-11 03:51:44,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:51:44,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 646324256, now seen corresponding path program 1 times [2024-10-11 03:51:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725058145] [2024-10-11 03:51:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:44,974 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:51:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725058145] [2024-10-11 03:51:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725058145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:44,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:44,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108906350] [2024-10-11 03:51:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:44,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:44,976 INFO L87 Difference]: Start difference. First operand 637 states and 845 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:46,020 INFO L93 Difference]: Finished difference Result 1002 states and 1319 transitions. [2024-10-11 03:51:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:46,024 INFO L225 Difference]: With dead ends: 1002 [2024-10-11 03:51:46,024 INFO L226 Difference]: Without dead ends: 926 [2024-10-11 03:51:46,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:46,025 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 3463 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3463 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:46,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3463 Valid, 1863 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-11 03:51:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 637. [2024-10-11 03:51:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3723577235772357) internal successors, (844), 636 states have internal predecessors, (844), 0 states have call successors, (0), 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:51:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 844 transitions. [2024-10-11 03:51:46,039 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 844 transitions. Word has length 91 [2024-10-11 03:51:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 844 transitions. [2024-10-11 03:51:46,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 844 transitions. [2024-10-11 03:51:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:46,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:46,041 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] [2024-10-11 03:51:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:51:46,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2043183991, now seen corresponding path program 1 times [2024-10-11 03:51:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141498461] [2024-10-11 03:51:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:46,438 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:51:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141498461] [2024-10-11 03:51:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141498461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:46,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970748137] [2024-10-11 03:51:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:46,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:46,440 INFO L87 Difference]: Start difference. First operand 637 states and 844 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:47,730 INFO L93 Difference]: Finished difference Result 1105 states and 1488 transitions. [2024-10-11 03:51:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:47,733 INFO L225 Difference]: With dead ends: 1105 [2024-10-11 03:51:47,733 INFO L226 Difference]: Without dead ends: 981 [2024-10-11 03:51:47,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:47,734 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 2558 mSDsluCounter, 2921 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2558 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:47,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2558 Valid, 3833 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:51:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-10-11 03:51:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 637. [2024-10-11 03:51:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3707317073170733) internal successors, (843), 636 states have internal predecessors, (843), 0 states have call successors, (0), 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:51:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 843 transitions. [2024-10-11 03:51:47,745 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 843 transitions. Word has length 91 [2024-10-11 03:51:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:47,745 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 843 transitions. [2024-10-11 03:51:47,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 843 transitions. [2024-10-11 03:51:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:47,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:47,748 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] [2024-10-11 03:51:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:51:47,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 850721804, now seen corresponding path program 1 times [2024-10-11 03:51:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969106412] [2024-10-11 03:51:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:48,077 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:51:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969106412] [2024-10-11 03:51:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969106412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:48,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:48,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521462935] [2024-10-11 03:51:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:48,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:48,081 INFO L87 Difference]: Start difference. First operand 637 states and 843 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:49,247 INFO L93 Difference]: Finished difference Result 1073 states and 1434 transitions. [2024-10-11 03:51:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:49,250 INFO L225 Difference]: With dead ends: 1073 [2024-10-11 03:51:49,250 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:51:49,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:49,251 INFO L432 NwaCegarLoop]: 614 mSDtfsCounter, 2570 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:49,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 2955 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:51:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 637. [2024-10-11 03:51:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3691056910569106) internal successors, (842), 636 states have internal predecessors, (842), 0 states have call successors, (0), 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:51:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 842 transitions. [2024-10-11 03:51:49,263 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 842 transitions. Word has length 91 [2024-10-11 03:51:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:49,263 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 842 transitions. [2024-10-11 03:51:49,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 842 transitions. [2024-10-11 03:51:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:49,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:49,266 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] [2024-10-11 03:51:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:51:49,266 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2041192084, now seen corresponding path program 1 times [2024-10-11 03:51:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2155391] [2024-10-11 03:51:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:49,542 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:51:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2155391] [2024-10-11 03:51:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2155391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:49,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454783804] [2024-10-11 03:51:49,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:49,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:49,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:49,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:49,545 INFO L87 Difference]: Start difference. First operand 637 states and 842 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:50,707 INFO L93 Difference]: Finished difference Result 1119 states and 1500 transitions. [2024-10-11 03:51:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:51:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:50,710 INFO L225 Difference]: With dead ends: 1119 [2024-10-11 03:51:50,710 INFO L226 Difference]: Without dead ends: 981 [2024-10-11 03:51:50,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:50,711 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 2589 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:50,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 3075 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-10-11 03:51:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 637. [2024-10-11 03:51:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.367479674796748) internal successors, (841), 636 states have internal predecessors, (841), 0 states have call successors, (0), 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:51:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 841 transitions. [2024-10-11 03:51:50,725 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 841 transitions. Word has length 91 [2024-10-11 03:51:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:50,726 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 841 transitions. [2024-10-11 03:51:50,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 841 transitions. [2024-10-11 03:51:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:50,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:50,728 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] [2024-10-11 03:51:50,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:51:50,729 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1474627327, now seen corresponding path program 1 times [2024-10-11 03:51:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306925063] [2024-10-11 03:51:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:51,058 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:51:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:51,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306925063] [2024-10-11 03:51:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306925063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49819375] [2024-10-11 03:51:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:51,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:51,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:51,062 INFO L87 Difference]: Start difference. First operand 637 states and 841 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:51,961 INFO L93 Difference]: Finished difference Result 1049 states and 1387 transitions. [2024-10-11 03:51:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:51,964 INFO L225 Difference]: With dead ends: 1049 [2024-10-11 03:51:51,964 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 03:51:51,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:51,965 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 2177 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:51,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2066 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 03:51:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 637. [2024-10-11 03:51:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3658536585365855) internal successors, (840), 636 states have internal predecessors, (840), 0 states have call successors, (0), 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:51:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 840 transitions. [2024-10-11 03:51:51,975 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 840 transitions. Word has length 93 [2024-10-11 03:51:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:51,976 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 840 transitions. [2024-10-11 03:51:51,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 840 transitions. [2024-10-11 03:51:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:51,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:51,978 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] [2024-10-11 03:51:51,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:51:51,978 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1188585192, now seen corresponding path program 1 times [2024-10-11 03:51:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348761035] [2024-10-11 03:51:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:52,293 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:51:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348761035] [2024-10-11 03:51:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348761035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:52,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:52,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371990122] [2024-10-11 03:51:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:52,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:52,296 INFO L87 Difference]: Start difference. First operand 637 states and 840 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:53,382 INFO L93 Difference]: Finished difference Result 1082 states and 1438 transitions. [2024-10-11 03:51:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:53,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:53,385 INFO L225 Difference]: With dead ends: 1082 [2024-10-11 03:51:53,385 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:51:53,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:53,386 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 2558 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2558 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:53,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2558 Valid, 3184 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:51:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 637. [2024-10-11 03:51:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3642276422764228) internal successors, (839), 636 states have internal predecessors, (839), 0 states have call successors, (0), 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:51:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 839 transitions. [2024-10-11 03:51:53,397 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 839 transitions. Word has length 93 [2024-10-11 03:51:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:53,397 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 839 transitions. [2024-10-11 03:51:53,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 839 transitions. [2024-10-11 03:51:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:53,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:53,399 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] [2024-10-11 03:51:53,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:51:53,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:53,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -281811597, now seen corresponding path program 1 times [2024-10-11 03:51:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895642688] [2024-10-11 03:51:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:53,738 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:51:53,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:53,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895642688] [2024-10-11 03:51:53,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895642688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:53,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300420087] [2024-10-11 03:51:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:53,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:53,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:53,740 INFO L87 Difference]: Start difference. First operand 637 states and 839 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:54,711 INFO L93 Difference]: Finished difference Result 1044 states and 1380 transitions. [2024-10-11 03:51:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:54,714 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 03:51:54,714 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 03:51:54,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:54,715 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 3283 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:54,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3283 Valid, 2173 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 03:51:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 637. [2024-10-11 03:51:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3626016260162601) internal successors, (838), 636 states have internal predecessors, (838), 0 states have call successors, (0), 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:51:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 838 transitions. [2024-10-11 03:51:54,775 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 838 transitions. Word has length 93 [2024-10-11 03:51:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:54,775 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 838 transitions. [2024-10-11 03:51:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2024-10-11 03:51:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:54,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:54,778 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] [2024-10-11 03:51:54,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:51:54,778 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:54,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash -610424553, now seen corresponding path program 1 times [2024-10-11 03:51:54,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:54,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029600650] [2024-10-11 03:51:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:55,057 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:51:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029600650] [2024-10-11 03:51:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029600650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018681738] [2024-10-11 03:51:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:55,061 INFO L87 Difference]: Start difference. First operand 637 states and 838 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:56,068 INFO L93 Difference]: Finished difference Result 1134 states and 1505 transitions. [2024-10-11 03:51:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:56,074 INFO L225 Difference]: With dead ends: 1134 [2024-10-11 03:51:56,074 INFO L226 Difference]: Without dead ends: 981 [2024-10-11 03:51:56,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:56,076 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 1824 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:56,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 2889 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-10-11 03:51:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 637. [2024-10-11 03:51:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.3609756097560977) internal successors, (837), 636 states have internal predecessors, (837), 0 states have call successors, (0), 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:51:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 837 transitions. [2024-10-11 03:51:56,091 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 837 transitions. Word has length 93 [2024-10-11 03:51:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 837 transitions. [2024-10-11 03:51:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 837 transitions. [2024-10-11 03:51:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:56,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:56,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] [2024-10-11 03:51:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:51:56,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 410318044, now seen corresponding path program 1 times [2024-10-11 03:51:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366347578] [2024-10-11 03:51:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:56,378 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:51:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366347578] [2024-10-11 03:51:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366347578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329242979] [2024-10-11 03:51:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:56,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:56,381 INFO L87 Difference]: Start difference. First operand 637 states and 837 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:57,416 INFO L93 Difference]: Finished difference Result 1044 states and 1377 transitions. [2024-10-11 03:51:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:57,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:57,418 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 03:51:57,418 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 03:51:57,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:57,419 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 3276 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:57,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 2173 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 03:51:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 637. [2024-10-11 03:51:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 615 states have (on average 1.359349593495935) internal successors, (836), 636 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 836 transitions. [2024-10-11 03:51:57,428 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 836 transitions. Word has length 93 [2024-10-11 03:51:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 836 transitions. [2024-10-11 03:51:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 836 transitions. [2024-10-11 03:51:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:57,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:57,431 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] [2024-10-11 03:51:57,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:51:57,431 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash -603748374, now seen corresponding path program 1 times [2024-10-11 03:51:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093066762] [2024-10-11 03:51:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:57,927 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:51:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093066762] [2024-10-11 03:51:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093066762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:57,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128624277] [2024-10-11 03:51:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:57,929 INFO L87 Difference]: Start difference. First operand 637 states and 836 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:59,631 INFO L93 Difference]: Finished difference Result 1344 states and 1818 transitions. [2024-10-11 03:51:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:51:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:59,635 INFO L225 Difference]: With dead ends: 1344 [2024-10-11 03:51:59,635 INFO L226 Difference]: Without dead ends: 1236 [2024-10-11 03:51:59,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:51:59,636 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 5888 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5888 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:59,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5888 Valid, 2921 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:51:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-11 03:51:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 641. [2024-10-11 03:51:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.35702746365105) internal successors, (840), 640 states have internal predecessors, (840), 0 states have call successors, (0), 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:51:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 840 transitions. [2024-10-11 03:51:59,647 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 840 transitions. Word has length 93 [2024-10-11 03:51:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:59,648 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 840 transitions. [2024-10-11 03:51:59,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 840 transitions. [2024-10-11 03:51:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:59,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:59,650 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] [2024-10-11 03:51:59,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:51:59,650 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:59,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 302673136, now seen corresponding path program 1 times [2024-10-11 03:51:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:59,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262851852] [2024-10-11 03:51:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:59,965 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:51:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262851852] [2024-10-11 03:51:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262851852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940827601] [2024-10-11 03:51:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:59,967 INFO L87 Difference]: Start difference. First operand 641 states and 840 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:00,990 INFO L93 Difference]: Finished difference Result 1073 states and 1423 transitions. [2024-10-11 03:52:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:00,994 INFO L225 Difference]: With dead ends: 1073 [2024-10-11 03:52:00,995 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:52:00,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:00,996 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 2545 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2545 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:00,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2545 Valid, 3348 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:52:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 641. [2024-10-11 03:52:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3554119547657513) internal successors, (839), 640 states have internal predecessors, (839), 0 states have call successors, (0), 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:52:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 839 transitions. [2024-10-11 03:52:01,006 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 839 transitions. Word has length 93 [2024-10-11 03:52:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:01,006 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 839 transitions. [2024-10-11 03:52:01,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 839 transitions. [2024-10-11 03:52:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:01,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:01,008 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] [2024-10-11 03:52:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:52:01,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 690949312, now seen corresponding path program 1 times [2024-10-11 03:52:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840058384] [2024-10-11 03:52:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:01,301 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:52:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840058384] [2024-10-11 03:52:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840058384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722598528] [2024-10-11 03:52:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:01,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:01,303 INFO L87 Difference]: Start difference. First operand 641 states and 839 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:02,201 INFO L93 Difference]: Finished difference Result 1044 states and 1376 transitions. [2024-10-11 03:52:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:02,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:02,205 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 03:52:02,205 INFO L226 Difference]: Without dead ends: 962 [2024-10-11 03:52:02,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:02,206 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 3205 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:02,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3205 Valid, 2241 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:52:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-11 03:52:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 641. [2024-10-11 03:52:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3537964458804523) internal successors, (838), 640 states have internal predecessors, (838), 0 states have call successors, (0), 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:52:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 838 transitions. [2024-10-11 03:52:02,215 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 838 transitions. Word has length 93 [2024-10-11 03:52:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:02,215 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 838 transitions. [2024-10-11 03:52:02,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 838 transitions. [2024-10-11 03:52:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:02,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:02,216 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] [2024-10-11 03:52:02,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:52:02,217 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:02,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash 99757788, now seen corresponding path program 1 times [2024-10-11 03:52:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383350423] [2024-10-11 03:52:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:02,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:02,477 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:52:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383350423] [2024-10-11 03:52:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383350423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:02,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534866338] [2024-10-11 03:52:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:02,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:02,479 INFO L87 Difference]: Start difference. First operand 641 states and 838 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:03,312 INFO L93 Difference]: Finished difference Result 1048 states and 1377 transitions. [2024-10-11 03:52:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:03,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:03,315 INFO L225 Difference]: With dead ends: 1048 [2024-10-11 03:52:03,315 INFO L226 Difference]: Without dead ends: 962 [2024-10-11 03:52:03,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:03,316 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 2085 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:03,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2085 Valid, 2238 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-11 03:52:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 641. [2024-10-11 03:52:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3521809369951534) internal successors, (837), 640 states have internal predecessors, (837), 0 states have call successors, (0), 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:52:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 837 transitions. [2024-10-11 03:52:03,376 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 837 transitions. Word has length 93 [2024-10-11 03:52:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:03,376 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 837 transitions. [2024-10-11 03:52:03,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 837 transitions. [2024-10-11 03:52:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:03,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:03,378 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] [2024-10-11 03:52:03,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:52:03,378 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash -839930569, now seen corresponding path program 1 times [2024-10-11 03:52:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407336077] [2024-10-11 03:52:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:03,935 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:52:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407336077] [2024-10-11 03:52:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407336077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:03,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059641504] [2024-10-11 03:52:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:03,937 INFO L87 Difference]: Start difference. First operand 641 states and 837 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:05,660 INFO L93 Difference]: Finished difference Result 1335 states and 1804 transitions. [2024-10-11 03:52:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:05,663 INFO L225 Difference]: With dead ends: 1335 [2024-10-11 03:52:05,663 INFO L226 Difference]: Without dead ends: 1236 [2024-10-11 03:52:05,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:52:05,664 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 5141 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:05,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 3814 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:52:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-11 03:52:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 645. [2024-10-11 03:52:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3499197431781702) internal successors, (841), 644 states have internal predecessors, (841), 0 states have call successors, (0), 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:52:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 841 transitions. [2024-10-11 03:52:05,674 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 841 transitions. Word has length 93 [2024-10-11 03:52:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:05,675 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 841 transitions. [2024-10-11 03:52:05,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 841 transitions. [2024-10-11 03:52:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:05,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:05,676 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] [2024-10-11 03:52:05,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:52:05,677 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:05,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1312261900, now seen corresponding path program 1 times [2024-10-11 03:52:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49147214] [2024-10-11 03:52:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:05,929 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:52:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:05,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49147214] [2024-10-11 03:52:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49147214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:05,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689212432] [2024-10-11 03:52:05,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:05,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:05,931 INFO L87 Difference]: Start difference. First operand 645 states and 841 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:06,736 INFO L93 Difference]: Finished difference Result 1010 states and 1314 transitions. [2024-10-11 03:52:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:06,739 INFO L225 Difference]: With dead ends: 1010 [2024-10-11 03:52:06,739 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 03:52:06,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:06,740 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 2181 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:06,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2035 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 03:52:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 645. [2024-10-11 03:52:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.348314606741573) internal successors, (840), 644 states have internal predecessors, (840), 0 states have call successors, (0), 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:52:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 840 transitions. [2024-10-11 03:52:06,750 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 840 transitions. Word has length 93 [2024-10-11 03:52:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:06,750 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 840 transitions. [2024-10-11 03:52:06,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 840 transitions. [2024-10-11 03:52:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:06,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:06,752 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] [2024-10-11 03:52:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:52:06,752 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 991764837, now seen corresponding path program 1 times [2024-10-11 03:52:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736366991] [2024-10-11 03:52:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:07,049 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:52:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736366991] [2024-10-11 03:52:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736366991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:07,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:07,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:07,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251440741] [2024-10-11 03:52:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:07,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:07,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:07,052 INFO L87 Difference]: Start difference. First operand 645 states and 840 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:08,138 INFO L93 Difference]: Finished difference Result 1068 states and 1412 transitions. [2024-10-11 03:52:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:08,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:08,141 INFO L225 Difference]: With dead ends: 1068 [2024-10-11 03:52:08,141 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:52:08,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:08,142 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 2534 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:08,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 3263 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:52:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 645. [2024-10-11 03:52:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.346709470304976) internal successors, (839), 644 states have internal predecessors, (839), 0 states have call successors, (0), 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:52:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 839 transitions. [2024-10-11 03:52:08,148 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 839 transitions. Word has length 93 [2024-10-11 03:52:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 839 transitions. [2024-10-11 03:52:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 839 transitions. [2024-10-11 03:52:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:08,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:08,150 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] [2024-10-11 03:52:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:52:08,150 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1532412921, now seen corresponding path program 1 times [2024-10-11 03:52:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370900803] [2024-10-11 03:52:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:08,397 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:52:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370900803] [2024-10-11 03:52:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370900803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:08,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426477057] [2024-10-11 03:52:08,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:08,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:08,398 INFO L87 Difference]: Start difference. First operand 645 states and 839 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:09,232 INFO L93 Difference]: Finished difference Result 1013 states and 1314 transitions. [2024-10-11 03:52:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:09,234 INFO L225 Difference]: With dead ends: 1013 [2024-10-11 03:52:09,234 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 03:52:09,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:09,235 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 2174 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:09,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2035 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 03:52:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 645. [2024-10-11 03:52:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3451043338683788) internal successors, (838), 644 states have internal predecessors, (838), 0 states have call successors, (0), 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:52:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 838 transitions. [2024-10-11 03:52:09,245 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 838 transitions. Word has length 93 [2024-10-11 03:52:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:09,245 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 838 transitions. [2024-10-11 03:52:09,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 838 transitions. [2024-10-11 03:52:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:09,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:09,247 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] [2024-10-11 03:52:09,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:52:09,247 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -170860907, now seen corresponding path program 1 times [2024-10-11 03:52:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366560370] [2024-10-11 03:52:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:09,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:52:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366560370] [2024-10-11 03:52:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366560370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193225412] [2024-10-11 03:52:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:09,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:09,494 INFO L87 Difference]: Start difference. First operand 645 states and 838 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:10,306 INFO L93 Difference]: Finished difference Result 1010 states and 1309 transitions. [2024-10-11 03:52:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:10,308 INFO L225 Difference]: With dead ends: 1010 [2024-10-11 03:52:10,309 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 03:52:10,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:10,309 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 2172 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:10,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 2030 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 03:52:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 645. [2024-10-11 03:52:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3434991974317818) internal successors, (837), 644 states have internal predecessors, (837), 0 states have call successors, (0), 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:52:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 837 transitions. [2024-10-11 03:52:10,317 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 837 transitions. Word has length 93 [2024-10-11 03:52:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 837 transitions. [2024-10-11 03:52:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 837 transitions. [2024-10-11 03:52:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:10,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:10,318 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] [2024-10-11 03:52:10,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:52:10,318 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1086119729, now seen corresponding path program 1 times [2024-10-11 03:52:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994136354] [2024-10-11 03:52:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:10,567 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:52:10,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994136354] [2024-10-11 03:52:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994136354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222525375] [2024-10-11 03:52:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:10,568 INFO L87 Difference]: Start difference. First operand 645 states and 837 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:11,574 INFO L93 Difference]: Finished difference Result 1082 states and 1423 transitions. [2024-10-11 03:52:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:11,576 INFO L225 Difference]: With dead ends: 1082 [2024-10-11 03:52:11,576 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:52:11,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:11,577 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 1802 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:11,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 2819 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:52:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 645. [2024-10-11 03:52:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3418940609951846) internal successors, (836), 644 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 836 transitions. [2024-10-11 03:52:11,586 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 836 transitions. Word has length 93 [2024-10-11 03:52:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 836 transitions. [2024-10-11 03:52:11,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 836 transitions. [2024-10-11 03:52:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:52:11,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:11,588 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] [2024-10-11 03:52:11,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:52:11,588 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:11,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -960925632, now seen corresponding path program 1 times [2024-10-11 03:52:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635500167] [2024-10-11 03:52:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:11,881 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:52:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635500167] [2024-10-11 03:52:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635500167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:11,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:11,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:11,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558365973] [2024-10-11 03:52:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:11,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:11,883 INFO L87 Difference]: Start difference. First operand 645 states and 836 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:12,751 INFO L93 Difference]: Finished difference Result 1052 states and 1375 transitions. [2024-10-11 03:52:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:12,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:52:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:12,753 INFO L225 Difference]: With dead ends: 1052 [2024-10-11 03:52:12,753 INFO L226 Difference]: Without dead ends: 966 [2024-10-11 03:52:12,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:12,753 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 3037 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:12,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 2401 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:52:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-10-11 03:52:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 645. [2024-10-11 03:52:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3402889245585874) internal successors, (835), 644 states have internal predecessors, (835), 0 states have call successors, (0), 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:52:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 835 transitions. [2024-10-11 03:52:12,760 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 835 transitions. Word has length 93 [2024-10-11 03:52:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:12,760 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 835 transitions. [2024-10-11 03:52:12,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 835 transitions. [2024-10-11 03:52:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:52:12,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:12,762 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] [2024-10-11 03:52:12,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:52:12,762 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:12,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1711046329, now seen corresponding path program 1 times [2024-10-11 03:52:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:12,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824095889] [2024-10-11 03:52:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:13,000 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:52:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824095889] [2024-10-11 03:52:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824095889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:13,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:13,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118756746] [2024-10-11 03:52:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:13,003 INFO L87 Difference]: Start difference. First operand 645 states and 835 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:13,947 INFO L93 Difference]: Finished difference Result 1082 states and 1417 transitions. [2024-10-11 03:52:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:52:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:13,949 INFO L225 Difference]: With dead ends: 1082 [2024-10-11 03:52:13,949 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:52:13,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:13,950 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 1851 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:13,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 2729 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:52:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:52:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 641. [2024-10-11 03:52:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 640 states have internal predecessors, (830), 0 states have call successors, (0), 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:52:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 830 transitions. [2024-10-11 03:52:13,957 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 830 transitions. Word has length 94 [2024-10-11 03:52:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 830 transitions. [2024-10-11 03:52:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 830 transitions. [2024-10-11 03:52:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:52:13,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:13,959 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] [2024-10-11 03:52:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:52:13,960 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1752046435, now seen corresponding path program 1 times [2024-10-11 03:52:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229981205] [2024-10-11 03:52:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:14,213 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:52:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:14,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229981205] [2024-10-11 03:52:14,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229981205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099743741] [2024-10-11 03:52:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:14,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:14,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:14,215 INFO L87 Difference]: Start difference. First operand 641 states and 830 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:15,100 INFO L93 Difference]: Finished difference Result 1043 states and 1364 transitions. [2024-10-11 03:52:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:15,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:52:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:15,103 INFO L225 Difference]: With dead ends: 1043 [2024-10-11 03:52:15,103 INFO L226 Difference]: Without dead ends: 962 [2024-10-11 03:52:15,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:15,104 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 2951 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2951 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:15,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2951 Valid, 2497 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:52:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-11 03:52:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 641. [2024-10-11 03:52:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3392568659127626) internal successors, (829), 640 states have internal predecessors, (829), 0 states have call successors, (0), 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:52:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 829 transitions. [2024-10-11 03:52:15,113 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 829 transitions. Word has length 94 [2024-10-11 03:52:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:15,113 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 829 transitions. [2024-10-11 03:52:15,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 829 transitions. [2024-10-11 03:52:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:52:15,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:15,115 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] [2024-10-11 03:52:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:52:15,115 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1328436666, now seen corresponding path program 1 times [2024-10-11 03:52:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7330004] [2024-10-11 03:52:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:15,369 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:52:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7330004] [2024-10-11 03:52:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7330004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:15,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389071805] [2024-10-11 03:52:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:15,373 INFO L87 Difference]: Start difference. First operand 641 states and 829 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:16,235 INFO L93 Difference]: Finished difference Result 1006 states and 1299 transitions. [2024-10-11 03:52:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:52:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:16,237 INFO L225 Difference]: With dead ends: 1006 [2024-10-11 03:52:16,237 INFO L226 Difference]: Without dead ends: 930 [2024-10-11 03:52:16,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:16,238 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 2129 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:16,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 2094 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-11 03:52:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 641. [2024-10-11 03:52:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3376413570274637) internal successors, (828), 640 states have internal predecessors, (828), 0 states have call successors, (0), 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:52:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 828 transitions. [2024-10-11 03:52:16,246 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 828 transitions. Word has length 94 [2024-10-11 03:52:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:16,246 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 828 transitions. [2024-10-11 03:52:16,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 828 transitions. [2024-10-11 03:52:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:52:16,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:16,247 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] [2024-10-11 03:52:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:52:16,247 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:16,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 296209564, now seen corresponding path program 1 times [2024-10-11 03:52:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:16,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606398590] [2024-10-11 03:52:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:16,580 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:52:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:16,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606398590] [2024-10-11 03:52:16,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606398590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:16,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:16,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608574151] [2024-10-11 03:52:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:16,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:16,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:16,583 INFO L87 Difference]: Start difference. First operand 641 states and 828 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)