./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:32:11,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:32:11,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:32:11,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:32:11,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:32:11,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:32:11,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:32:11,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:32:11,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:32:11,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:32:11,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:32:11,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:32:11,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:32:11,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:32:11,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:32:11,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:32:11,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:32:11,361 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:32:11,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:32:11,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:32:11,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:32:11,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:32:11,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:32:11,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:32:11,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 [2024-11-07 00:32:11,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:32:11,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:32:11,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:32:11,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:32:11,723 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:32:11,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:32:13,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:32:13,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:32:13,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:32:13,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcc23b2f0/3c9594ac7fe8480c88ae5a1619a107b3/FLAG2a59b458b [2024-11-07 00:32:13,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcc23b2f0/3c9594ac7fe8480c88ae5a1619a107b3 [2024-11-07 00:32:13,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:32:13,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:32:13,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:32:13,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:32:13,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:32:13,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:13" (1/1) ... [2024-11-07 00:32:13,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e7459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:13, skipping insertion in model container [2024-11-07 00:32:13,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:13" (1/1) ... [2024-11-07 00:32:13,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:32:14,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-11-07 00:32:14,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-11-07 00:32:14,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-11-07 00:32:14,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-11-07 00:32:14,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-11-07 00:32:14,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-11-07 00:32:14,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-11-07 00:32:14,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-11-07 00:32:14,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-11-07 00:32:14,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-11-07 00:32:14,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-11-07 00:32:14,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-11-07 00:32:14,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-11-07 00:32:14,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-11-07 00:32:14,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-11-07 00:32:14,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-11-07 00:32:14,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:32:14,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:32:14,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-11-07 00:32:14,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-11-07 00:32:14,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-11-07 00:32:14,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-11-07 00:32:14,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-11-07 00:32:14,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-11-07 00:32:14,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-11-07 00:32:14,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-11-07 00:32:14,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-11-07 00:32:14,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-11-07 00:32:14,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-11-07 00:32:14,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-11-07 00:32:14,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-11-07 00:32:14,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-11-07 00:32:14,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-11-07 00:32:14,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-11-07 00:32:14,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:32:14,491 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:32:14,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14 WrapperNode [2024-11-07 00:32:14,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:32:14,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:32:14,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:32:14,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:32:14,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,634 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3579 [2024-11-07 00:32:14,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:32:14,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:32:14,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:32:14,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:32:14,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,708 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-11-07 00:32:14,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:32:14,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:32:14,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:32:14,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:32:14,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (1/1) ... [2024-11-07 00:32:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:32:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:32:14,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:32:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:32:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:32:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:32:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:32:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:32:15,082 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:32:15,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:32:16,906 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-11-07 00:32:16,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:32:16,947 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:32:16,948 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:32:16,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:16 BoogieIcfgContainer [2024-11-07 00:32:16,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:32:16,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:32:16,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:32:16,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:32:16,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:13" (1/3) ... [2024-11-07 00:32:16,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a617b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:16, skipping insertion in model container [2024-11-07 00:32:16,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:14" (2/3) ... [2024-11-07 00:32:16,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a617b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:16, skipping insertion in model container [2024-11-07 00:32:16,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:16" (3/3) ... [2024-11-07 00:32:16,958 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:32:16,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:32:16,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-07 00:32:17,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:32:17,048 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;@172fa56c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:32:17,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-07 00:32:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 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-11-07 00:32:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 00:32:17,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:17,079 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] [2024-11-07 00:32:17,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:17,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash -50607350, now seen corresponding path program 1 times [2024-11-07 00:32:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477354383] [2024-11-07 00:32:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477354383] [2024-11-07 00:32:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477354383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980682610] [2024-11-07 00:32:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:17,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:17,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:17,788 INFO L87 Difference]: Start difference. First operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 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 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:18,436 INFO L93 Difference]: Finished difference Result 1184 states and 2033 transitions. [2024-11-07 00:32:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:18,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 00:32:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:18,456 INFO L225 Difference]: With dead ends: 1184 [2024-11-07 00:32:18,456 INFO L226 Difference]: Without dead ends: 711 [2024-11-07 00:32:18,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:32:18,467 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 3196 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3196 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:18,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3196 Valid, 818 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-07 00:32:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 651. [2024-11-07 00:32:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 635 states have (on average 1.3653543307086615) internal successors, (867), 650 states have internal predecessors, (867), 0 states have call successors, (0), 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-11-07 00:32:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 867 transitions. [2024-11-07 00:32:18,561 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 867 transitions. Word has length 71 [2024-11-07 00:32:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:18,561 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 867 transitions. [2024-11-07 00:32:18,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 867 transitions. [2024-11-07 00:32:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:32:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:18,565 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] [2024-11-07 00:32:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:32:18,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -329897172, now seen corresponding path program 1 times [2024-11-07 00:32:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38348843] [2024-11-07 00:32:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38348843] [2024-11-07 00:32:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38348843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110228336] [2024-11-07 00:32:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:18,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:18,883 INFO L87 Difference]: Start difference. First operand 651 states and 867 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:19,253 INFO L93 Difference]: Finished difference Result 1140 states and 1557 transitions. [2024-11-07 00:32:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 00:32:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:19,257 INFO L225 Difference]: With dead ends: 1140 [2024-11-07 00:32:19,257 INFO L226 Difference]: Without dead ends: 611 [2024-11-07 00:32:19,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:32:19,260 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1651 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:19,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 328 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-07 00:32:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2024-11-07 00:32:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 595 states have (on average 1.373109243697479) internal successors, (817), 610 states have internal predecessors, (817), 0 states have call successors, (0), 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-11-07 00:32:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 817 transitions. [2024-11-07 00:32:19,286 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 817 transitions. Word has length 72 [2024-11-07 00:32:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:19,286 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 817 transitions. [2024-11-07 00:32:19,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 817 transitions. [2024-11-07 00:32:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:32:19,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:19,291 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] [2024-11-07 00:32:19,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:32:19,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518485, now seen corresponding path program 1 times [2024-11-07 00:32:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484887743] [2024-11-07 00:32:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484887743] [2024-11-07 00:32:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484887743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341821427] [2024-11-07 00:32:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:19,511 INFO L87 Difference]: Start difference. First operand 611 states and 817 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-07 00:32:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:19,811 INFO L93 Difference]: Finished difference Result 1100 states and 1505 transitions. [2024-11-07 00:32:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-07 00:32:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:19,815 INFO L225 Difference]: With dead ends: 1100 [2024-11-07 00:32:19,815 INFO L226 Difference]: Without dead ends: 579 [2024-11-07 00:32:19,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:32:19,817 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1558 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:19,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 322 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-07 00:32:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-07 00:32:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 563 states have (on average 1.3836589698046182) internal successors, (779), 578 states have internal predecessors, (779), 0 states have call successors, (0), 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-11-07 00:32:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 779 transitions. [2024-11-07 00:32:19,851 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 779 transitions. Word has length 73 [2024-11-07 00:32:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 779 transitions. [2024-11-07 00:32:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-07 00:32:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 779 transitions. [2024-11-07 00:32:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:32:19,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:19,854 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] [2024-11-07 00:32:19,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:32:19,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:19,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2052061875, now seen corresponding path program 1 times [2024-11-07 00:32:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:19,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087327564] [2024-11-07 00:32:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087327564] [2024-11-07 00:32:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087327564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:20,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284695444] [2024-11-07 00:32:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:20,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:20,004 INFO L87 Difference]: Start difference. First operand 579 states and 779 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-07 00:32:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:20,254 INFO L93 Difference]: Finished difference Result 1068 states and 1465 transitions. [2024-11-07 00:32:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:32:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:20,257 INFO L225 Difference]: With dead ends: 1068 [2024-11-07 00:32:20,257 INFO L226 Difference]: Without dead ends: 554 [2024-11-07 00:32:20,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:32:20,259 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1500 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:20,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 309 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-07 00:32:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-07 00:32:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 538 states have (on average 1.3940520446096654) internal successors, (750), 553 states have internal predecessors, (750), 0 states have call successors, (0), 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-11-07 00:32:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 750 transitions. [2024-11-07 00:32:20,278 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 750 transitions. Word has length 74 [2024-11-07 00:32:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 750 transitions. [2024-11-07 00:32:20,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-07 00:32:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 750 transitions. [2024-11-07 00:32:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:32:20,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:20,280 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] [2024-11-07 00:32:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:32:20,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1326375668, now seen corresponding path program 1 times [2024-11-07 00:32:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620243540] [2024-11-07 00:32:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620243540] [2024-11-07 00:32:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620243540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068055079] [2024-11-07 00:32:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:20,512 INFO L87 Difference]: Start difference. First operand 554 states and 750 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-07 00:32:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:20,778 INFO L93 Difference]: Finished difference Result 1043 states and 1434 transitions. [2024-11-07 00:32:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:20,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-07 00:32:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:20,781 INFO L225 Difference]: With dead ends: 1043 [2024-11-07 00:32:20,781 INFO L226 Difference]: Without dead ends: 543 [2024-11-07 00:32:20,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:32:20,786 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1448 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:20,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 304 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-07 00:32:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-07 00:32:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.396584440227704) internal successors, (736), 542 states have internal predecessors, (736), 0 states have call successors, (0), 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-11-07 00:32:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 736 transitions. [2024-11-07 00:32:20,807 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 736 transitions. Word has length 75 [2024-11-07 00:32:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:20,808 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 736 transitions. [2024-11-07 00:32:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-07 00:32:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 736 transitions. [2024-11-07 00:32:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:32:20,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:20,810 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] [2024-11-07 00:32:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:32:20,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:20,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -976633234, now seen corresponding path program 1 times [2024-11-07 00:32:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082762659] [2024-11-07 00:32:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082762659] [2024-11-07 00:32:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082762659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:32:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912120861] [2024-11-07 00:32:21,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:32:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:21,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:32:21,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:32:21,304 INFO L87 Difference]: Start difference. First operand 543 states and 736 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:21,978 INFO L93 Difference]: Finished difference Result 1045 states and 1398 transitions. [2024-11-07 00:32:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:32:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-07 00:32:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:21,982 INFO L225 Difference]: With dead ends: 1045 [2024-11-07 00:32:21,982 INFO L226 Difference]: Without dead ends: 771 [2024-11-07 00:32:21,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:32:21,986 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 2075 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:21,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 1140 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-07 00:32:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 543. [2024-11-07 00:32:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.394686907020873) internal successors, (735), 542 states have internal predecessors, (735), 0 states have call successors, (0), 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-11-07 00:32:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 735 transitions. [2024-11-07 00:32:22,021 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 735 transitions. Word has length 76 [2024-11-07 00:32:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:22,022 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 735 transitions. [2024-11-07 00:32:22,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 735 transitions. [2024-11-07 00:32:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:32:22,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:22,026 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] [2024-11-07 00:32:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:32:22,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:22,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 649885335, now seen corresponding path program 1 times [2024-11-07 00:32:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385184334] [2024-11-07 00:32:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385184334] [2024-11-07 00:32:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385184334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957144497] [2024-11-07 00:32:22,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:22,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:22,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:22,485 INFO L87 Difference]: Start difference. First operand 543 states and 735 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:23,194 INFO L93 Difference]: Finished difference Result 801 states and 1108 transitions. [2024-11-07 00:32:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-07 00:32:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:23,197 INFO L225 Difference]: With dead ends: 801 [2024-11-07 00:32:23,197 INFO L226 Difference]: Without dead ends: 611 [2024-11-07 00:32:23,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:23,199 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1561 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:23,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1596 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-07 00:32:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 543. [2024-11-07 00:32:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3927893738140418) internal successors, (734), 542 states have internal predecessors, (734), 0 states have call successors, (0), 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-11-07 00:32:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 734 transitions. [2024-11-07 00:32:23,214 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 734 transitions. Word has length 76 [2024-11-07 00:32:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 734 transitions. [2024-11-07 00:32:23,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 734 transitions. [2024-11-07 00:32:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:32:23,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:23,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] [2024-11-07 00:32:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:32:23,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1538930145, now seen corresponding path program 1 times [2024-11-07 00:32:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602116597] [2024-11-07 00:32:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602116597] [2024-11-07 00:32:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602116597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:23,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477466737] [2024-11-07 00:32:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:23,564 INFO L87 Difference]: Start difference. First operand 543 states and 734 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:24,234 INFO L93 Difference]: Finished difference Result 827 states and 1108 transitions. [2024-11-07 00:32:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:24,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-07 00:32:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:24,238 INFO L225 Difference]: With dead ends: 827 [2024-11-07 00:32:24,238 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 00:32:24,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:24,240 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1356 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:24,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1164 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 00:32:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2024-11-07 00:32:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3908918406072106) internal successors, (733), 542 states have internal predecessors, (733), 0 states have call successors, (0), 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-11-07 00:32:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 733 transitions. [2024-11-07 00:32:24,255 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 733 transitions. Word has length 76 [2024-11-07 00:32:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:24,255 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 733 transitions. [2024-11-07 00:32:24,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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-11-07 00:32:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 733 transitions. [2024-11-07 00:32:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:24,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:24,257 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] [2024-11-07 00:32:24,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:32:24,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:24,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 684383254, now seen corresponding path program 1 times [2024-11-07 00:32:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193921013] [2024-11-07 00:32:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:24,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:24,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-11-07 00:32:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:24,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193921013] [2024-11-07 00:32:24,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193921013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:24,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:24,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:24,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310335659] [2024-11-07 00:32:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:24,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:24,570 INFO L87 Difference]: Start difference. First operand 543 states and 733 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:25,217 INFO L93 Difference]: Finished difference Result 953 states and 1297 transitions. [2024-11-07 00:32:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:25,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:25,221 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:32:25,221 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 00:32:25,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:25,222 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1351 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:25,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1167 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 00:32:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2024-11-07 00:32:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3889943074003794) internal successors, (732), 542 states have internal predecessors, (732), 0 states have call successors, (0), 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-11-07 00:32:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 732 transitions. [2024-11-07 00:32:25,238 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 732 transitions. Word has length 78 [2024-11-07 00:32:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:25,239 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 732 transitions. [2024-11-07 00:32:25,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 732 transitions. [2024-11-07 00:32:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:25,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:25,240 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] [2024-11-07 00:32:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:32:25,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1698386940, now seen corresponding path program 1 times [2024-11-07 00:32:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254628518] [2024-11-07 00:32:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254628518] [2024-11-07 00:32:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254628518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378753563] [2024-11-07 00:32:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:25,576 INFO L87 Difference]: Start difference. First operand 543 states and 732 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:26,284 INFO L93 Difference]: Finished difference Result 1030 states and 1415 transitions. [2024-11-07 00:32:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:26,288 INFO L225 Difference]: With dead ends: 1030 [2024-11-07 00:32:26,288 INFO L226 Difference]: Without dead ends: 870 [2024-11-07 00:32:26,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:26,290 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 2107 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:26,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 1608 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-07 00:32:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2024-11-07 00:32:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3870967741935485) internal successors, (731), 542 states have internal predecessors, (731), 0 states have call successors, (0), 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-11-07 00:32:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 731 transitions. [2024-11-07 00:32:26,304 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 731 transitions. Word has length 78 [2024-11-07 00:32:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:26,305 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 731 transitions. [2024-11-07 00:32:26,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 731 transitions. [2024-11-07 00:32:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:26,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:26,306 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] [2024-11-07 00:32:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:32:26,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 275538026, now seen corresponding path program 1 times [2024-11-07 00:32:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:26,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365555418] [2024-11-07 00:32:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365555418] [2024-11-07 00:32:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365555418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543959507] [2024-11-07 00:32:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:26,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:26,601 INFO L87 Difference]: Start difference. First operand 543 states and 731 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:27,258 INFO L93 Difference]: Finished difference Result 953 states and 1295 transitions. [2024-11-07 00:32:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:27,263 INFO L225 Difference]: With dead ends: 953 [2024-11-07 00:32:27,263 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 00:32:27,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:27,265 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 2053 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:27,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2053 Valid, 1164 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 00:32:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2024-11-07 00:32:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3851992409867173) internal successors, (730), 542 states have internal predecessors, (730), 0 states have call successors, (0), 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-11-07 00:32:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 730 transitions. [2024-11-07 00:32:27,281 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 730 transitions. Word has length 78 [2024-11-07 00:32:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:27,282 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 730 transitions. [2024-11-07 00:32:27,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 730 transitions. [2024-11-07 00:32:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:27,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:27,285 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] [2024-11-07 00:32:27,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:32:27,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1207054515, now seen corresponding path program 1 times [2024-11-07 00:32:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75801146] [2024-11-07 00:32:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75801146] [2024-11-07 00:32:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75801146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:27,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789797482] [2024-11-07 00:32:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:27,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:27,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:27,620 INFO L87 Difference]: Start difference. First operand 543 states and 730 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:28,390 INFO L93 Difference]: Finished difference Result 980 states and 1341 transitions. [2024-11-07 00:32:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:28,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:28,394 INFO L225 Difference]: With dead ends: 980 [2024-11-07 00:32:28,394 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:28,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:28,395 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1765 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:28,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 1653 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2024-11-07 00:32:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3833017077798861) internal successors, (729), 542 states have internal predecessors, (729), 0 states have call successors, (0), 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-11-07 00:32:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 729 transitions. [2024-11-07 00:32:28,411 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 729 transitions. Word has length 78 [2024-11-07 00:32:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:28,411 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 729 transitions. [2024-11-07 00:32:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 729 transitions. [2024-11-07 00:32:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:28,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:28,413 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] [2024-11-07 00:32:28,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:32:28,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1663299084, now seen corresponding path program 1 times [2024-11-07 00:32:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346839037] [2024-11-07 00:32:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346839037] [2024-11-07 00:32:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346839037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262629415] [2024-11-07 00:32:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:28,723 INFO L87 Difference]: Start difference. First operand 543 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:29,404 INFO L93 Difference]: Finished difference Result 1021 states and 1401 transitions. [2024-11-07 00:32:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:29,408 INFO L225 Difference]: With dead ends: 1021 [2024-11-07 00:32:29,409 INFO L226 Difference]: Without dead ends: 870 [2024-11-07 00:32:29,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:29,411 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 2586 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2586 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:29,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2586 Valid, 1467 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-07 00:32:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2024-11-07 00:32:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.381404174573055) internal successors, (728), 542 states have internal predecessors, (728), 0 states have call successors, (0), 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-11-07 00:32:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 728 transitions. [2024-11-07 00:32:29,429 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 728 transitions. Word has length 78 [2024-11-07 00:32:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 728 transitions. [2024-11-07 00:32:29,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 728 transitions. [2024-11-07 00:32:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:29,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:29,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] [2024-11-07 00:32:29,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:32:29,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1808320783, now seen corresponding path program 1 times [2024-11-07 00:32:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694011588] [2024-11-07 00:32:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694011588] [2024-11-07 00:32:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694011588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534507052] [2024-11-07 00:32:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:29,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:29,681 INFO L87 Difference]: Start difference. First operand 543 states and 728 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:30,249 INFO L93 Difference]: Finished difference Result 867 states and 1189 transitions. [2024-11-07 00:32:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:30,252 INFO L225 Difference]: With dead ends: 867 [2024-11-07 00:32:30,252 INFO L226 Difference]: Without dead ends: 611 [2024-11-07 00:32:30,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:30,253 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1513 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:30,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1257 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-07 00:32:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 543. [2024-11-07 00:32:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3776091081593929) internal successors, (726), 542 states have internal predecessors, (726), 0 states have call successors, (0), 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-11-07 00:32:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 726 transitions. [2024-11-07 00:32:30,279 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 726 transitions. Word has length 78 [2024-11-07 00:32:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:30,279 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 726 transitions. [2024-11-07 00:32:30,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 726 transitions. [2024-11-07 00:32:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:30,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:30,285 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] [2024-11-07 00:32:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:32:30,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 688086315, now seen corresponding path program 1 times [2024-11-07 00:32:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170380134] [2024-11-07 00:32:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:30,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170380134] [2024-11-07 00:32:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170380134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:30,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201279444] [2024-11-07 00:32:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:30,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:30,551 INFO L87 Difference]: Start difference. First operand 543 states and 726 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:31,179 INFO L93 Difference]: Finished difference Result 990 states and 1349 transitions. [2024-11-07 00:32:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:31,183 INFO L225 Difference]: With dead ends: 990 [2024-11-07 00:32:31,183 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:31,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:31,185 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1230 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:31,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 1398 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2024-11-07 00:32:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3738140417457305) internal successors, (724), 542 states have internal predecessors, (724), 0 states have call successors, (0), 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-11-07 00:32:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 724 transitions. [2024-11-07 00:32:31,199 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 724 transitions. Word has length 78 [2024-11-07 00:32:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:31,199 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 724 transitions. [2024-11-07 00:32:31,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 724 transitions. [2024-11-07 00:32:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:32:31,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:31,200 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] [2024-11-07 00:32:31,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:32:31,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1096931543, now seen corresponding path program 1 times [2024-11-07 00:32:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:31,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560004899] [2024-11-07 00:32:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560004899] [2024-11-07 00:32:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560004899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365159580] [2024-11-07 00:32:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:31,427 INFO L87 Difference]: Start difference. First operand 543 states and 724 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:32,254 INFO L93 Difference]: Finished difference Result 1040 states and 1420 transitions. [2024-11-07 00:32:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:32:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:32,262 INFO L225 Difference]: With dead ends: 1040 [2024-11-07 00:32:32,262 INFO L226 Difference]: Without dead ends: 870 [2024-11-07 00:32:32,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:32,263 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 2042 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:32,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 1865 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:32:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-07 00:32:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 543. [2024-11-07 00:32:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3700189753320684) internal successors, (722), 542 states have internal predecessors, (722), 0 states have call successors, (0), 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-11-07 00:32:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 722 transitions. [2024-11-07 00:32:32,278 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 722 transitions. Word has length 78 [2024-11-07 00:32:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:32,279 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 722 transitions. [2024-11-07 00:32:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-07 00:32:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 722 transitions. [2024-11-07 00:32:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:32,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:32,280 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] [2024-11-07 00:32:32,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:32:32,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:32,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1780834374, now seen corresponding path program 1 times [2024-11-07 00:32:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851407696] [2024-11-07 00:32:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851407696] [2024-11-07 00:32:32,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851407696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322019125] [2024-11-07 00:32:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:32,531 INFO L87 Difference]: Start difference. First operand 543 states and 722 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:33,152 INFO L93 Difference]: Finished difference Result 950 states and 1282 transitions. [2024-11-07 00:32:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:33,155 INFO L225 Difference]: With dead ends: 950 [2024-11-07 00:32:33,155 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 00:32:33,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:33,157 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2224 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:33,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 1221 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 00:32:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2024-11-07 00:32:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3681214421252372) internal successors, (721), 542 states have internal predecessors, (721), 0 states have call successors, (0), 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-11-07 00:32:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 721 transitions. [2024-11-07 00:32:33,170 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 721 transitions. Word has length 80 [2024-11-07 00:32:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:33,170 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 721 transitions. [2024-11-07 00:32:33,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 721 transitions. [2024-11-07 00:32:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:33,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:33,172 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] [2024-11-07 00:32:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:32:33,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -839965141, now seen corresponding path program 1 times [2024-11-07 00:32:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461277329] [2024-11-07 00:32:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461277329] [2024-11-07 00:32:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461277329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843842698] [2024-11-07 00:32:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:33,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:33,445 INFO L87 Difference]: Start difference. First operand 543 states and 721 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:34,215 INFO L93 Difference]: Finished difference Result 984 states and 1335 transitions. [2024-11-07 00:32:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:34,219 INFO L225 Difference]: With dead ends: 984 [2024-11-07 00:32:34,219 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:34,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:34,220 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 2198 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:34,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 1660 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2024-11-07 00:32:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.366223908918406) internal successors, (720), 542 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-07 00:32:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 720 transitions. [2024-11-07 00:32:34,232 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 720 transitions. Word has length 80 [2024-11-07 00:32:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:34,232 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 720 transitions. [2024-11-07 00:32:34,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 720 transitions. [2024-11-07 00:32:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:34,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:34,234 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] [2024-11-07 00:32:34,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:32:34,234 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:34,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1112544149, now seen corresponding path program 1 times [2024-11-07 00:32:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:34,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001502724] [2024-11-07 00:32:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001502724] [2024-11-07 00:32:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001502724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:34,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156835652] [2024-11-07 00:32:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:34,482 INFO L87 Difference]: Start difference. First operand 543 states and 720 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:35,208 INFO L93 Difference]: Finished difference Result 989 states and 1339 transitions. [2024-11-07 00:32:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:35,211 INFO L225 Difference]: With dead ends: 989 [2024-11-07 00:32:35,212 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:35,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:35,213 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1360 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:35,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1645 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 543. [2024-11-07 00:32:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.364326375711575) internal successors, (719), 542 states have internal predecessors, (719), 0 states have call successors, (0), 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-11-07 00:32:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 719 transitions. [2024-11-07 00:32:35,225 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 719 transitions. Word has length 80 [2024-11-07 00:32:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:35,225 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 719 transitions. [2024-11-07 00:32:35,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 719 transitions. [2024-11-07 00:32:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:35,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:35,227 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] [2024-11-07 00:32:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:32:35,227 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1251491228, now seen corresponding path program 1 times [2024-11-07 00:32:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988292404] [2024-11-07 00:32:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988292404] [2024-11-07 00:32:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988292404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851095284] [2024-11-07 00:32:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:35,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:35,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:35,726 INFO L87 Difference]: Start difference. First operand 543 states and 719 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:36,897 INFO L93 Difference]: Finished difference Result 1384 states and 1923 transitions. [2024-11-07 00:32:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:36,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:36,901 INFO L225 Difference]: With dead ends: 1384 [2024-11-07 00:32:36,901 INFO L226 Difference]: Without dead ends: 1246 [2024-11-07 00:32:36,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:32:36,903 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 4007 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4007 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:36,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4007 Valid, 2186 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:32:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-07 00:32:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 547. [2024-11-07 00:32:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3615819209039548) internal successors, (723), 546 states have internal predecessors, (723), 0 states have call successors, (0), 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-11-07 00:32:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2024-11-07 00:32:36,916 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 80 [2024-11-07 00:32:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:36,916 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2024-11-07 00:32:36,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2024-11-07 00:32:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:36,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:36,918 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] [2024-11-07 00:32:36,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:32:36,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:36,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -955374417, now seen corresponding path program 1 times [2024-11-07 00:32:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787859547] [2024-11-07 00:32:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787859547] [2024-11-07 00:32:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787859547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755989487] [2024-11-07 00:32:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:37,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:37,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:37,192 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:37,948 INFO L93 Difference]: Finished difference Result 954 states and 1283 transitions. [2024-11-07 00:32:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:37,952 INFO L225 Difference]: With dead ends: 954 [2024-11-07 00:32:37,952 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:37,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:37,953 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 2123 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:37,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 1782 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.35969868173258) internal successors, (722), 546 states have internal predecessors, (722), 0 states have call successors, (0), 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-11-07 00:32:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 722 transitions. [2024-11-07 00:32:37,964 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 722 transitions. Word has length 80 [2024-11-07 00:32:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 722 transitions. [2024-11-07 00:32:37,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 722 transitions. [2024-11-07 00:32:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:37,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:37,966 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] [2024-11-07 00:32:37,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:32:37,966 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -306680341, now seen corresponding path program 1 times [2024-11-07 00:32:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:37,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962899247] [2024-11-07 00:32:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962899247] [2024-11-07 00:32:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962899247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:38,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535570460] [2024-11-07 00:32:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:38,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:38,230 INFO L87 Difference]: Start difference. First operand 547 states and 722 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:38,895 INFO L93 Difference]: Finished difference Result 954 states and 1282 transitions. [2024-11-07 00:32:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:38,900 INFO L225 Difference]: With dead ends: 954 [2024-11-07 00:32:38,900 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:38,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:38,904 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1866 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:38,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 1292 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3578154425612052) internal successors, (721), 546 states have internal predecessors, (721), 0 states have call successors, (0), 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-11-07 00:32:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2024-11-07 00:32:38,914 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 80 [2024-11-07 00:32:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:38,914 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2024-11-07 00:32:38,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2024-11-07 00:32:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:38,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:38,916 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] [2024-11-07 00:32:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:32:38,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1961273491, now seen corresponding path program 1 times [2024-11-07 00:32:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256436632] [2024-11-07 00:32:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256436632] [2024-11-07 00:32:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256436632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017771561] [2024-11-07 00:32:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:39,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:39,188 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:39,879 INFO L93 Difference]: Finished difference Result 952 states and 1278 transitions. [2024-11-07 00:32:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:39,881 INFO L225 Difference]: With dead ends: 952 [2024-11-07 00:32:39,881 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:39,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:39,882 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 2198 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:39,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 1596 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3559322033898304) internal successors, (720), 546 states have internal predecessors, (720), 0 states have call successors, (0), 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-11-07 00:32:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 720 transitions. [2024-11-07 00:32:39,891 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 720 transitions. Word has length 80 [2024-11-07 00:32:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 720 transitions. [2024-11-07 00:32:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 720 transitions. [2024-11-07 00:32:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:39,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:39,893 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] [2024-11-07 00:32:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:32:39,893 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1780916949, now seen corresponding path program 1 times [2024-11-07 00:32:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:39,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929288818] [2024-11-07 00:32:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929288818] [2024-11-07 00:32:40,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929288818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798163096] [2024-11-07 00:32:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:40,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:40,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:40,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:40,108 INFO L87 Difference]: Start difference. First operand 547 states and 720 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:40,697 INFO L93 Difference]: Finished difference Result 996 states and 1343 transitions. [2024-11-07 00:32:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:40,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:40,700 INFO L225 Difference]: With dead ends: 996 [2024-11-07 00:32:40,700 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:40,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:40,701 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1172 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 1510 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 547. [2024-11-07 00:32:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3521657250470809) internal successors, (718), 546 states have internal predecessors, (718), 0 states have call successors, (0), 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-11-07 00:32:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 718 transitions. [2024-11-07 00:32:40,711 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 718 transitions. Word has length 80 [2024-11-07 00:32:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:40,711 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 718 transitions. [2024-11-07 00:32:40,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 718 transitions. [2024-11-07 00:32:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:40,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:40,713 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] [2024-11-07 00:32:40,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:32:40,713 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash 601853245, now seen corresponding path program 1 times [2024-11-07 00:32:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510955933] [2024-11-07 00:32:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510955933] [2024-11-07 00:32:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510955933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572278321] [2024-11-07 00:32:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:40,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:40,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:40,977 INFO L87 Difference]: Start difference. First operand 547 states and 718 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:41,661 INFO L93 Difference]: Finished difference Result 960 states and 1284 transitions. [2024-11-07 00:32:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:41,664 INFO L225 Difference]: With dead ends: 960 [2024-11-07 00:32:41,664 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:41,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:41,665 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 2167 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:41,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 1652 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3483992467043315) internal successors, (716), 546 states have internal predecessors, (716), 0 states have call successors, (0), 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-11-07 00:32:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 716 transitions. [2024-11-07 00:32:41,675 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 716 transitions. Word has length 80 [2024-11-07 00:32:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:41,675 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 716 transitions. [2024-11-07 00:32:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 716 transitions. [2024-11-07 00:32:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:41,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:41,677 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] [2024-11-07 00:32:41,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:32:41,677 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -953833721, now seen corresponding path program 1 times [2024-11-07 00:32:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694617914] [2024-11-07 00:32:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:41,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694617914] [2024-11-07 00:32:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694617914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:41,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:41,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817712001] [2024-11-07 00:32:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:41,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:41,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:41,908 INFO L87 Difference]: Start difference. First operand 547 states and 716 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:42,571 INFO L93 Difference]: Finished difference Result 1064 states and 1430 transitions. [2024-11-07 00:32:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:42,574 INFO L225 Difference]: With dead ends: 1064 [2024-11-07 00:32:42,574 INFO L226 Difference]: Without dead ends: 874 [2024-11-07 00:32:42,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:42,575 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1581 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:42,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 2017 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-07 00:32:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2024-11-07 00:32:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.344632768361582) internal successors, (714), 546 states have internal predecessors, (714), 0 states have call successors, (0), 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-11-07 00:32:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 714 transitions. [2024-11-07 00:32:42,584 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 714 transitions. Word has length 80 [2024-11-07 00:32:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:42,584 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 714 transitions. [2024-11-07 00:32:42,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 714 transitions. [2024-11-07 00:32:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:42,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:42,585 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] [2024-11-07 00:32:42,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:32:42,586 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1702835234, now seen corresponding path program 1 times [2024-11-07 00:32:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765275171] [2024-11-07 00:32:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765275171] [2024-11-07 00:32:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765275171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162116147] [2024-11-07 00:32:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:42,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:42,831 INFO L87 Difference]: Start difference. First operand 547 states and 714 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:43,393 INFO L93 Difference]: Finished difference Result 831 states and 1085 transitions. [2024-11-07 00:32:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:43,396 INFO L225 Difference]: With dead ends: 831 [2024-11-07 00:32:43,396 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:43,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:43,397 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 2158 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 1652 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3408662900188324) internal successors, (712), 546 states have internal predecessors, (712), 0 states have call successors, (0), 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-11-07 00:32:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 712 transitions. [2024-11-07 00:32:43,407 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 712 transitions. Word has length 80 [2024-11-07 00:32:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:43,408 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 712 transitions. [2024-11-07 00:32:43,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 712 transitions. [2024-11-07 00:32:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:43,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:43,409 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] [2024-11-07 00:32:43,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:32:43,410 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 209361868, now seen corresponding path program 1 times [2024-11-07 00:32:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231657905] [2024-11-07 00:32:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231657905] [2024-11-07 00:32:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231657905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:43,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640549616] [2024-11-07 00:32:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:43,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:43,609 INFO L87 Difference]: Start difference. First operand 547 states and 712 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:44,135 INFO L93 Difference]: Finished difference Result 863 states and 1131 transitions. [2024-11-07 00:32:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:44,138 INFO L225 Difference]: With dead ends: 863 [2024-11-07 00:32:44,138 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 00:32:44,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:44,139 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 1115 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:44,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1619 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 00:32:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 547. [2024-11-07 00:32:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3370998116760828) internal successors, (710), 546 states have internal predecessors, (710), 0 states have call successors, (0), 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-11-07 00:32:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 710 transitions. [2024-11-07 00:32:44,148 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 710 transitions. Word has length 80 [2024-11-07 00:32:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:44,148 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 710 transitions. [2024-11-07 00:32:44,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 710 transitions. [2024-11-07 00:32:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:44,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:44,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] [2024-11-07 00:32:44,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:32:44,150 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1191963760, now seen corresponding path program 1 times [2024-11-07 00:32:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222947427] [2024-11-07 00:32:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222947427] [2024-11-07 00:32:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222947427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403515839] [2024-11-07 00:32:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:44,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:44,397 INFO L87 Difference]: Start difference. First operand 547 states and 710 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:45,005 INFO L93 Difference]: Finished difference Result 956 states and 1271 transitions. [2024-11-07 00:32:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:45,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:45,009 INFO L225 Difference]: With dead ends: 956 [2024-11-07 00:32:45,009 INFO L226 Difference]: Without dead ends: 826 [2024-11-07 00:32:45,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:45,010 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 2130 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:45,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 1700 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-07 00:32:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 547. [2024-11-07 00:32:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.3333333333333333) internal successors, (708), 546 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-07 00:32:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 708 transitions. [2024-11-07 00:32:45,020 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 708 transitions. Word has length 80 [2024-11-07 00:32:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:45,021 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 708 transitions. [2024-11-07 00:32:45,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 708 transitions. [2024-11-07 00:32:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:45,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:45,022 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] [2024-11-07 00:32:45,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:32:45,023 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1836995487, now seen corresponding path program 1 times [2024-11-07 00:32:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:45,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110153047] [2024-11-07 00:32:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110153047] [2024-11-07 00:32:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110153047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734742431] [2024-11-07 00:32:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:45,442 INFO L87 Difference]: Start difference. First operand 547 states and 708 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:46,287 INFO L93 Difference]: Finished difference Result 1151 states and 1551 transitions. [2024-11-07 00:32:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:46,291 INFO L225 Difference]: With dead ends: 1151 [2024-11-07 00:32:46,292 INFO L226 Difference]: Without dead ends: 1146 [2024-11-07 00:32:46,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:32:46,293 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 3909 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3909 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:46,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3909 Valid, 1457 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-11-07 00:32:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 555. [2024-11-07 00:32:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 539 states have (on average 1.3283858998144713) internal successors, (716), 554 states have internal predecessors, (716), 0 states have call successors, (0), 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-11-07 00:32:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 716 transitions. [2024-11-07 00:32:46,310 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 716 transitions. Word has length 80 [2024-11-07 00:32:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:46,310 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 716 transitions. [2024-11-07 00:32:46,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-07 00:32:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 716 transitions. [2024-11-07 00:32:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:32:46,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:46,312 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] [2024-11-07 00:32:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:32:46,312 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1816522350, now seen corresponding path program 1 times [2024-11-07 00:32:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614689197] [2024-11-07 00:32:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614689197] [2024-11-07 00:32:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614689197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:46,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525448163] [2024-11-07 00:32:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:46,518 INFO L87 Difference]: Start difference. First operand 555 states and 716 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-07 00:32:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:47,048 INFO L93 Difference]: Finished difference Result 992 states and 1318 transitions. [2024-11-07 00:32:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 00:32:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:47,051 INFO L225 Difference]: With dead ends: 992 [2024-11-07 00:32:47,051 INFO L226 Difference]: Without dead ends: 854 [2024-11-07 00:32:47,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:47,052 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1098 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:47,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1651 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-07 00:32:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 551. [2024-11-07 00:32:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 1.3289719626168224) internal successors, (711), 550 states have internal predecessors, (711), 0 states have call successors, (0), 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-11-07 00:32:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 711 transitions. [2024-11-07 00:32:47,059 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 711 transitions. Word has length 81 [2024-11-07 00:32:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:47,059 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 711 transitions. [2024-11-07 00:32:47,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-07 00:32:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 711 transitions. [2024-11-07 00:32:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:32:47,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:47,060 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] [2024-11-07 00:32:47,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:32:47,060 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:47,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash 846117342, now seen corresponding path program 1 times [2024-11-07 00:32:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475098146] [2024-11-07 00:32:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475098146] [2024-11-07 00:32:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475098146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429644040] [2024-11-07 00:32:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:47,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:47,248 INFO L87 Difference]: Start difference. First operand 551 states and 711 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-07 00:32:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:47,761 INFO L93 Difference]: Finished difference Result 827 states and 1072 transitions. [2024-11-07 00:32:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 00:32:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:47,764 INFO L225 Difference]: With dead ends: 827 [2024-11-07 00:32:47,764 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 00:32:47,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:47,765 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1754 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:47,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 1428 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 00:32:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 543. [2024-11-07 00:32:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 527 states have (on average 1.3301707779886147) internal successors, (701), 542 states have internal predecessors, (701), 0 states have call successors, (0), 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-11-07 00:32:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 701 transitions. [2024-11-07 00:32:47,776 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 701 transitions. Word has length 81 [2024-11-07 00:32:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:47,777 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 701 transitions. [2024-11-07 00:32:47,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-07 00:32:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 701 transitions. [2024-11-07 00:32:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:32:47,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:47,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] [2024-11-07 00:32:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:32:47,778 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1125287833, now seen corresponding path program 1 times [2024-11-07 00:32:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083222497] [2024-11-07 00:32:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083222497] [2024-11-07 00:32:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083222497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:48,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438550521] [2024-11-07 00:32:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:32:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:32:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:32:48,217 INFO L87 Difference]: Start difference. First operand 543 states and 701 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:48,645 INFO L93 Difference]: Finished difference Result 861 states and 1143 transitions. [2024-11-07 00:32:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 00:32:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:48,647 INFO L225 Difference]: With dead ends: 861 [2024-11-07 00:32:48,648 INFO L226 Difference]: Without dead ends: 618 [2024-11-07 00:32:48,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:32:48,649 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1449 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:48,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1515 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-07 00:32:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 426. [2024-11-07 00:32:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 415 states have (on average 1.3349397590361445) internal successors, (554), 425 states have internal predecessors, (554), 0 states have call successors, (0), 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-11-07 00:32:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 554 transitions. [2024-11-07 00:32:48,655 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 554 transitions. Word has length 82 [2024-11-07 00:32:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 554 transitions. [2024-11-07 00:32:48,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 554 transitions. [2024-11-07 00:32:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:32:48,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:48,657 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] [2024-11-07 00:32:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:32:48,657 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash 996849594, now seen corresponding path program 1 times [2024-11-07 00:32:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805534628] [2024-11-07 00:32:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:48,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:49,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-11-07 00:32:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805534628] [2024-11-07 00:32:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805534628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 00:32:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101752586] [2024-11-07 00:32:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:49,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 00:32:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:49,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 00:32:49,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:32:49,400 INFO L87 Difference]: Start difference. First operand 426 states and 554 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:50,548 INFO L93 Difference]: Finished difference Result 972 states and 1301 transitions. [2024-11-07 00:32:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:50,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 00:32:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:50,550 INFO L225 Difference]: With dead ends: 972 [2024-11-07 00:32:50,550 INFO L226 Difference]: Without dead ends: 842 [2024-11-07 00:32:50,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:32:50,551 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 2696 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:50,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 3528 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-07 00:32:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 424. [2024-11-07 00:32:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 413 states have (on average 1.3317191283292977) internal successors, (550), 423 states have internal predecessors, (550), 0 states have call successors, (0), 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-11-07 00:32:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 550 transitions. [2024-11-07 00:32:50,556 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 550 transitions. Word has length 82 [2024-11-07 00:32:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 550 transitions. [2024-11-07 00:32:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 550 transitions. [2024-11-07 00:32:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:32:50,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:50,557 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] [2024-11-07 00:32:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:32:50,558 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -783667554, now seen corresponding path program 1 times [2024-11-07 00:32:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529498220] [2024-11-07 00:32:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529498220] [2024-11-07 00:32:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529498220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:32:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921523858] [2024-11-07 00:32:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:50,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:50,891 INFO L87 Difference]: Start difference. First operand 424 states and 550 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:51,331 INFO L93 Difference]: Finished difference Result 754 states and 1029 transitions. [2024-11-07 00:32:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:32:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 00:32:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:51,332 INFO L225 Difference]: With dead ends: 754 [2024-11-07 00:32:51,332 INFO L226 Difference]: Without dead ends: 576 [2024-11-07 00:32:51,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:32:51,333 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1399 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:51,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2444 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-07 00:32:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 372. [2024-11-07 00:32:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 364 states have (on average 1.3269230769230769) internal successors, (483), 371 states have internal predecessors, (483), 0 states have call successors, (0), 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-11-07 00:32:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 483 transitions. [2024-11-07 00:32:51,339 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 483 transitions. Word has length 82 [2024-11-07 00:32:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 483 transitions. [2024-11-07 00:32:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 483 transitions. [2024-11-07 00:32:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:32:51,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:51,340 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] [2024-11-07 00:32:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:32:51,341 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:51,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash 504555190, now seen corresponding path program 1 times [2024-11-07 00:32:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882910992] [2024-11-07 00:32:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882910992] [2024-11-07 00:32:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882910992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-07 00:32:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437043086] [2024-11-07 00:32:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:52,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 00:32:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 00:32:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-07 00:32:52,911 INFO L87 Difference]: Start difference. First operand 372 states and 483 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:55,291 INFO L93 Difference]: Finished difference Result 734 states and 987 transitions. [2024-11-07 00:32:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-07 00:32:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 00:32:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:55,293 INFO L225 Difference]: With dead ends: 734 [2024-11-07 00:32:55,293 INFO L226 Difference]: Without dead ends: 604 [2024-11-07 00:32:55,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 00:32:55,294 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 565 mSDsluCounter, 4916 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 5191 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:55,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 5191 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:32:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-07 00:32:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 387. [2024-11-07 00:32:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 379 states have (on average 1.3298153034300793) internal successors, (504), 386 states have internal predecessors, (504), 0 states have call successors, (0), 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-11-07 00:32:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 504 transitions. [2024-11-07 00:32:55,298 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 504 transitions. Word has length 82 [2024-11-07 00:32:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:55,299 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 504 transitions. [2024-11-07 00:32:55,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 504 transitions. [2024-11-07 00:32:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:32:55,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:55,299 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] [2024-11-07 00:32:55,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:32:55,299 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616581, now seen corresponding path program 1 times [2024-11-07 00:32:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182694513] [2024-11-07 00:32:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182694513] [2024-11-07 00:32:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182694513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:55,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:32:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970758724] [2024-11-07 00:32:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:32:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:32:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:55,980 INFO L87 Difference]: Start difference. First operand 387 states and 504 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:56,793 INFO L93 Difference]: Finished difference Result 554 states and 738 transitions. [2024-11-07 00:32:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 00:32:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:56,795 INFO L225 Difference]: With dead ends: 554 [2024-11-07 00:32:56,795 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 00:32:56,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 00:32:56,796 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 736 mSDsluCounter, 2850 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:56,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 3103 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 00:32:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-07 00:32:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 361 states have (on average 1.3240997229916898) internal successors, (478), 368 states have internal predecessors, (478), 0 states have call successors, (0), 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-11-07 00:32:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 478 transitions. [2024-11-07 00:32:56,800 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 478 transitions. Word has length 82 [2024-11-07 00:32:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:56,800 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 478 transitions. [2024-11-07 00:32:56,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-07 00:32:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 478 transitions. [2024-11-07 00:32:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:32:56,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:56,801 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] [2024-11-07 00:32:56,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:32:56,802 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:56,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1724267320, now seen corresponding path program 1 times [2024-11-07 00:32:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410104242] [2024-11-07 00:32:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410104242] [2024-11-07 00:32:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410104242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:32:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270652140] [2024-11-07 00:32:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:57,206 INFO L87 Difference]: Start difference. First operand 369 states and 478 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:57,634 INFO L93 Difference]: Finished difference Result 684 states and 928 transitions. [2024-11-07 00:32:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:57,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-07 00:32:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:57,639 INFO L225 Difference]: With dead ends: 684 [2024-11-07 00:32:57,639 INFO L226 Difference]: Without dead ends: 552 [2024-11-07 00:32:57,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:32:57,641 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1357 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:57,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 1334 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-07 00:32:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 344. [2024-11-07 00:32:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 337 states have (on average 1.311572700296736) internal successors, (442), 343 states have internal predecessors, (442), 0 states have call successors, (0), 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-11-07 00:32:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2024-11-07 00:32:57,649 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 83 [2024-11-07 00:32:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:57,649 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2024-11-07 00:32:57,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2024-11-07 00:32:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:32:57,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:57,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] [2024-11-07 00:32:57,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:32:57,650 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:57,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash 165528205, now seen corresponding path program 1 times [2024-11-07 00:32:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099012643] [2024-11-07 00:32:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:57,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099012643] [2024-11-07 00:32:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099012643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:58,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:32:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805262063] [2024-11-07 00:32:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:58,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:58,047 INFO L87 Difference]: Start difference. First operand 344 states and 442 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:58,321 INFO L93 Difference]: Finished difference Result 470 states and 632 transitions. [2024-11-07 00:32:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-07 00:32:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:58,323 INFO L225 Difference]: With dead ends: 470 [2024-11-07 00:32:58,323 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 00:32:58,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:32:58,323 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 260 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:58,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1169 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:32:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 00:32:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-07 00:32:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.3193916349809887) internal successors, (347), 265 states have internal predecessors, (347), 0 states have call successors, (0), 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-11-07 00:32:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 347 transitions. [2024-11-07 00:32:58,327 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 347 transitions. Word has length 83 [2024-11-07 00:32:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 347 transitions. [2024-11-07 00:32:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 347 transitions. [2024-11-07 00:32:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:32:58,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:58,327 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] [2024-11-07 00:32:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:32:58,328 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -823147502, now seen corresponding path program 1 times [2024-11-07 00:32:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109412328] [2024-11-07 00:32:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109412328] [2024-11-07 00:32:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109412328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431309159] [2024-11-07 00:32:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:58,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:58,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:58,502 INFO L87 Difference]: Start difference. First operand 266 states and 347 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:58,772 INFO L93 Difference]: Finished difference Result 435 states and 584 transitions. [2024-11-07 00:32:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-07 00:32:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:58,773 INFO L225 Difference]: With dead ends: 435 [2024-11-07 00:32:58,773 INFO L226 Difference]: Without dead ends: 428 [2024-11-07 00:32:58,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:58,774 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 558 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:58,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 526 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-07 00:32:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 266. [2024-11-07 00:32:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.3155893536121672) internal successors, (346), 265 states have internal predecessors, (346), 0 states have call successors, (0), 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-11-07 00:32:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 346 transitions. [2024-11-07 00:32:58,777 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 346 transitions. Word has length 83 [2024-11-07 00:32:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:58,778 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 346 transitions. [2024-11-07 00:32:58,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 346 transitions. [2024-11-07 00:32:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:32:58,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:58,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] [2024-11-07 00:32:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:32:58,778 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:58,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash -892730834, now seen corresponding path program 1 times [2024-11-07 00:32:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246968315] [2024-11-07 00:32:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246968315] [2024-11-07 00:32:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246968315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:59,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809537598] [2024-11-07 00:32:59,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:59,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:59,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:59,016 INFO L87 Difference]: Start difference. First operand 266 states and 346 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:59,459 INFO L93 Difference]: Finished difference Result 608 states and 832 transitions. [2024-11-07 00:32:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-07 00:32:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:59,460 INFO L225 Difference]: With dead ends: 608 [2024-11-07 00:32:59,460 INFO L226 Difference]: Without dead ends: 452 [2024-11-07 00:32:59,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:59,461 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 649 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:59,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1030 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-07 00:32:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 266. [2024-11-07 00:32:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.3079847908745248) internal successors, (344), 265 states have internal predecessors, (344), 0 states have call successors, (0), 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-11-07 00:32:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2024-11-07 00:32:59,467 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 83 [2024-11-07 00:32:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:59,467 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2024-11-07 00:32:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-07 00:32:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2024-11-07 00:32:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 00:32:59,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:59,467 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-11-07 00:32:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 00:32:59,468 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:59,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1767300528, now seen corresponding path program 1 times [2024-11-07 00:32:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35277578] [2024-11-07 00:32:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35277578] [2024-11-07 00:33:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35277578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-07 00:33:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262902588] [2024-11-07 00:33:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:33:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:33:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:00,865 INFO L87 Difference]: Start difference. First operand 266 states and 344 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:02,529 INFO L93 Difference]: Finished difference Result 439 states and 585 transitions. [2024-11-07 00:33:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 00:33:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:02,531 INFO L225 Difference]: With dead ends: 439 [2024-11-07 00:33:02,531 INFO L226 Difference]: Without dead ends: 433 [2024-11-07 00:33:02,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 00:33:02,532 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 483 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:02,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 2708 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:33:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-07 00:33:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 282. [2024-11-07 00:33:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 279 states have (on average 1.3046594982078854) internal successors, (364), 281 states have internal predecessors, (364), 0 states have call successors, (0), 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-11-07 00:33:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 364 transitions. [2024-11-07 00:33:02,539 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 364 transitions. Word has length 85 [2024-11-07 00:33:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:02,539 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 364 transitions. [2024-11-07 00:33:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 364 transitions. [2024-11-07 00:33:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 00:33:02,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:02,540 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-11-07 00:33:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 00:33:02,540 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 645292930, now seen corresponding path program 1 times [2024-11-07 00:33:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469291614] [2024-11-07 00:33:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469291614] [2024-11-07 00:33:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469291614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:04,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-07 00:33:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017723974] [2024-11-07 00:33:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:04,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:33:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:33:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:04,029 INFO L87 Difference]: Start difference. First operand 282 states and 364 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:05,985 INFO L93 Difference]: Finished difference Result 454 states and 606 transitions. [2024-11-07 00:33:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 00:33:05,986 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:05,987 INFO L225 Difference]: With dead ends: 454 [2024-11-07 00:33:05,987 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 00:33:05,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=425, Invalid=2125, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 00:33:05,988 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 751 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3851 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:05,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3851 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:33:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 00:33:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 286. [2024-11-07 00:33:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 283 states have (on average 1.303886925795053) internal successors, (369), 285 states have internal predecessors, (369), 0 states have call successors, (0), 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-11-07 00:33:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 369 transitions. [2024-11-07 00:33:05,996 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 369 transitions. Word has length 85 [2024-11-07 00:33:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 369 transitions. [2024-11-07 00:33:05,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-11-07 00:33:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 369 transitions. [2024-11-07 00:33:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:33:05,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:05,997 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-11-07 00:33:05,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 00:33:05,997 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:05,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash -424299778, now seen corresponding path program 1 times [2024-11-07 00:33:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777541905] [2024-11-07 00:33:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777541905] [2024-11-07 00:33:06,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777541905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:06,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:06,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:33:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548198803] [2024-11-07 00:33:06,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:33:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:33:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:06,415 INFO L87 Difference]: Start difference. First operand 286 states and 369 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 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-11-07 00:33:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:06,858 INFO L93 Difference]: Finished difference Result 438 states and 591 transitions. [2024-11-07 00:33:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:33:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 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-11-07 00:33:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:06,860 INFO L225 Difference]: With dead ends: 438 [2024-11-07 00:33:06,860 INFO L226 Difference]: Without dead ends: 432 [2024-11-07 00:33:06,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:33:06,861 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 825 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:06,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1234 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-07 00:33:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 274. [2024-11-07 00:33:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 273 states have internal predecessors, (354), 0 states have call successors, (0), 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-11-07 00:33:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2024-11-07 00:33:06,865 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 86 [2024-11-07 00:33:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:06,865 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2024-11-07 00:33:06,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 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-11-07 00:33:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2024-11-07 00:33:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:33:06,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:06,865 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-11-07 00:33:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 00:33:06,865 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1988293680, now seen corresponding path program 1 times [2024-11-07 00:33:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472919898] [2024-11-07 00:33:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472919898] [2024-11-07 00:33:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472919898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:07,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:33:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026131602] [2024-11-07 00:33:07,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:33:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:33:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:07,346 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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-11-07 00:33:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:07,954 INFO L93 Difference]: Finished difference Result 742 states and 1030 transitions. [2024-11-07 00:33:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:33:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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-11-07 00:33:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:07,955 INFO L225 Difference]: With dead ends: 742 [2024-11-07 00:33:07,955 INFO L226 Difference]: Without dead ends: 727 [2024-11-07 00:33:07,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:33:07,956 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 1013 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:07,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 2741 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-07 00:33:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 248. [2024-11-07 00:33:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 247 states have internal predecessors, (323), 0 states have call successors, (0), 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-11-07 00:33:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 323 transitions. [2024-11-07 00:33:07,959 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 323 transitions. Word has length 86 [2024-11-07 00:33:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:07,959 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 323 transitions. [2024-11-07 00:33:07,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 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-11-07 00:33:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 323 transitions. [2024-11-07 00:33:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 00:33:07,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:07,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 00:33:07,960 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 529887998, now seen corresponding path program 1 times [2024-11-07 00:33:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412352462] [2024-11-07 00:33:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412352462] [2024-11-07 00:33:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412352462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653307212] [2024-11-07 00:33:08,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:08,080 INFO L87 Difference]: Start difference. First operand 248 states and 323 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-07 00:33:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:08,238 INFO L93 Difference]: Finished difference Result 1508 states and 2223 transitions. [2024-11-07 00:33:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:33:08,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-07 00:33:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:08,241 INFO L225 Difference]: With dead ends: 1508 [2024-11-07 00:33:08,241 INFO L226 Difference]: Without dead ends: 1382 [2024-11-07 00:33:08,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:33:08,242 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1497 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:08,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1542 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-07 00:33:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 372. [2024-11-07 00:33:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.3692722371967656) internal successors, (508), 371 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-07 00:33:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 508 transitions. [2024-11-07 00:33:08,254 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 508 transitions. Word has length 112 [2024-11-07 00:33:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:08,254 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 508 transitions. [2024-11-07 00:33:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-07 00:33:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 508 transitions. [2024-11-07 00:33:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:08,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:08,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 00:33:08,256 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:08,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash 257111127, now seen corresponding path program 1 times [2024-11-07 00:33:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014014563] [2024-11-07 00:33:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014014563] [2024-11-07 00:33:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014014563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926756926] [2024-11-07 00:33:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:08,389 INFO L87 Difference]: Start difference. First operand 372 states and 508 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:08,460 INFO L93 Difference]: Finished difference Result 1748 states and 2569 transitions. [2024-11-07 00:33:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:08,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:08,462 INFO L225 Difference]: With dead ends: 1748 [2024-11-07 00:33:08,462 INFO L226 Difference]: Without dead ends: 1498 [2024-11-07 00:33:08,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:08,463 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1197 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:08,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 947 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-07 00:33:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 620. [2024-11-07 00:33:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4216478190630049) internal successors, (880), 619 states have internal predecessors, (880), 0 states have call successors, (0), 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-11-07 00:33:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 880 transitions. [2024-11-07 00:33:08,471 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 880 transitions. Word has length 114 [2024-11-07 00:33:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 880 transitions. [2024-11-07 00:33:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 880 transitions. [2024-11-07 00:33:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:08,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:08,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:08,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 00:33:08,472 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1982497248, now seen corresponding path program 1 times [2024-11-07 00:33:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214606594] [2024-11-07 00:33:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:08,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214606594] [2024-11-07 00:33:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214606594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057534189] [2024-11-07 00:33:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:08,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:08,632 INFO L87 Difference]: Start difference. First operand 620 states and 880 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:08,727 INFO L93 Difference]: Finished difference Result 1120 states and 1628 transitions. [2024-11-07 00:33:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:08,729 INFO L225 Difference]: With dead ends: 1120 [2024-11-07 00:33:08,729 INFO L226 Difference]: Without dead ends: 622 [2024-11-07 00:33:08,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:33:08,729 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 100 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:08,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 647 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-07 00:33:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2024-11-07 00:33:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4151857835218093) internal successors, (876), 619 states have internal predecessors, (876), 0 states have call successors, (0), 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-11-07 00:33:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 876 transitions. [2024-11-07 00:33:08,736 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 876 transitions. Word has length 114 [2024-11-07 00:33:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:08,737 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 876 transitions. [2024-11-07 00:33:08,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 876 transitions. [2024-11-07 00:33:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:08,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:08,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 00:33:08,738 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:08,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1242756927, now seen corresponding path program 1 times [2024-11-07 00:33:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680319043] [2024-11-07 00:33:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680319043] [2024-11-07 00:33:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680319043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120206454] [2024-11-07 00:33:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:08,798 INFO L87 Difference]: Start difference. First operand 620 states and 876 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:08,822 INFO L93 Difference]: Finished difference Result 1564 states and 2274 transitions. [2024-11-07 00:33:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:08,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:08,825 INFO L225 Difference]: With dead ends: 1564 [2024-11-07 00:33:08,825 INFO L226 Difference]: Without dead ends: 1066 [2024-11-07 00:33:08,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:08,826 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 112 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:08,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 308 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-11-07 00:33:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1056. [2024-11-07 00:33:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1055 states have (on average 1.423696682464455) internal successors, (1502), 1055 states have internal predecessors, (1502), 0 states have call successors, (0), 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-11-07 00:33:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1502 transitions. [2024-11-07 00:33:08,838 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1502 transitions. Word has length 114 [2024-11-07 00:33:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:08,838 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1502 transitions. [2024-11-07 00:33:08,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1502 transitions. [2024-11-07 00:33:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:08,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:08,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:08,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 00:33:08,840 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:08,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash 335311913, now seen corresponding path program 1 times [2024-11-07 00:33:08,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:08,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17667993] [2024-11-07 00:33:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17667993] [2024-11-07 00:33:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17667993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692370451] [2024-11-07 00:33:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:08,959 INFO L87 Difference]: Start difference. First operand 1056 states and 1502 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,048 INFO L93 Difference]: Finished difference Result 3632 states and 5278 transitions. [2024-11-07 00:33:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,053 INFO L225 Difference]: With dead ends: 3632 [2024-11-07 00:33:09,053 INFO L226 Difference]: Without dead ends: 3164 [2024-11-07 00:33:09,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:09,054 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1022 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2024-11-07 00:33:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 1756. [2024-11-07 00:33:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 1.438176638176638) internal successors, (2524), 1755 states have internal predecessors, (2524), 0 states have call successors, (0), 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-11-07 00:33:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2524 transitions. [2024-11-07 00:33:09,087 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2524 transitions. Word has length 114 [2024-11-07 00:33:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,087 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2524 transitions. [2024-11-07 00:33:09,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2524 transitions. [2024-11-07 00:33:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:09,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:09,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 00:33:09,088 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -784107677, now seen corresponding path program 1 times [2024-11-07 00:33:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555635846] [2024-11-07 00:33:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:09,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555635846] [2024-11-07 00:33:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555635846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:09,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387635867] [2024-11-07 00:33:09,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:09,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:09,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:09,180 INFO L87 Difference]: Start difference. First operand 1756 states and 2524 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,281 INFO L93 Difference]: Finished difference Result 4098 states and 5960 transitions. [2024-11-07 00:33:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,287 INFO L225 Difference]: With dead ends: 4098 [2024-11-07 00:33:09,287 INFO L226 Difference]: Without dead ends: 3630 [2024-11-07 00:33:09,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:09,289 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1011 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1091 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2024-11-07 00:33:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 2222. [2024-11-07 00:33:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2221 states have (on average 1.4434939216569114) internal successors, (3206), 2221 states have internal predecessors, (3206), 0 states have call successors, (0), 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-11-07 00:33:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3206 transitions. [2024-11-07 00:33:09,313 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3206 transitions. Word has length 114 [2024-11-07 00:33:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,313 INFO L471 AbstractCegarLoop]: Abstraction has 2222 states and 3206 transitions. [2024-11-07 00:33:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3206 transitions. [2024-11-07 00:33:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 00:33:09,315 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -651533795, now seen corresponding path program 1 times [2024-11-07 00:33:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78981606] [2024-11-07 00:33:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78981606] [2024-11-07 00:33:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78981606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294760096] [2024-11-07 00:33:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:09,423 INFO L87 Difference]: Start difference. First operand 2222 states and 3206 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,516 INFO L93 Difference]: Finished difference Result 4564 states and 6642 transitions. [2024-11-07 00:33:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,524 INFO L225 Difference]: With dead ends: 4564 [2024-11-07 00:33:09,524 INFO L226 Difference]: Without dead ends: 4096 [2024-11-07 00:33:09,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:09,527 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1048 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1119 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2024-11-07 00:33:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 2688. [2024-11-07 00:33:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2687 states have (on average 1.4469668775586155) internal successors, (3888), 2687 states have internal predecessors, (3888), 0 states have call successors, (0), 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-11-07 00:33:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 3888 transitions. [2024-11-07 00:33:09,560 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 3888 transitions. Word has length 114 [2024-11-07 00:33:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 2688 states and 3888 transitions. [2024-11-07 00:33:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-07 00:33:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 3888 transitions. [2024-11-07 00:33:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:33:09,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:09,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 00:33:09,562 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1268705059, now seen corresponding path program 1 times [2024-11-07 00:33:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691518760] [2024-11-07 00:33:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691518760] [2024-11-07 00:33:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691518760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731471036] [2024-11-07 00:33:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:09,633 INFO L87 Difference]: Start difference. First operand 2688 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-11-07 00:33:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,658 INFO L93 Difference]: Finished difference Result 7644 states and 11090 transitions. [2024-11-07 00:33:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-07 00:33:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,666 INFO L225 Difference]: With dead ends: 7644 [2024-11-07 00:33:09,666 INFO L226 Difference]: Without dead ends: 5078 [2024-11-07 00:33:09,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:09,670 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 90 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 409 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2024-11-07 00:33:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 4900. [2024-11-07 00:33:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 4899 states have (on average 1.4431516636048174) internal successors, (7070), 4899 states have internal predecessors, (7070), 0 states have call successors, (0), 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-11-07 00:33:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 7070 transitions. [2024-11-07 00:33:09,716 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 7070 transitions. Word has length 115 [2024-11-07 00:33:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,716 INFO L471 AbstractCegarLoop]: Abstraction has 4900 states and 7070 transitions. [2024-11-07 00:33:09,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-11-07 00:33:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 7070 transitions. [2024-11-07 00:33:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:09,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 00:33:09,718 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1444283991, now seen corresponding path program 1 times [2024-11-07 00:33:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123606636] [2024-11-07 00:33:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123606636] [2024-11-07 00:33:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123606636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615530915] [2024-11-07 00:33:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:09,817 INFO L87 Difference]: Start difference. First operand 4900 states and 7070 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-07 00:33:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,850 INFO L93 Difference]: Finished difference Result 14104 states and 20328 transitions. [2024-11-07 00:33:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-07 00:33:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,866 INFO L225 Difference]: With dead ends: 14104 [2024-11-07 00:33:09,866 INFO L226 Difference]: Without dead ends: 9326 [2024-11-07 00:33:09,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:09,873 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 409 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9326 states. [2024-11-07 00:33:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9326 to 8972. [2024-11-07 00:33:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8972 states, 8971 states have (on average 1.433730910712295) internal successors, (12862), 8971 states have internal predecessors, (12862), 0 states have call successors, (0), 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-11-07 00:33:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 12862 transitions. [2024-11-07 00:33:09,960 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 12862 transitions. Word has length 116 [2024-11-07 00:33:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,960 INFO L471 AbstractCegarLoop]: Abstraction has 8972 states and 12862 transitions. [2024-11-07 00:33:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-07 00:33:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 12862 transitions. [2024-11-07 00:33:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 00:33:09,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 00:33:09,961 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1913447474, now seen corresponding path program 1 times [2024-11-07 00:33:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5017909] [2024-11-07 00:33:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5017909] [2024-11-07 00:33:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5017909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496279014] [2024-11-07 00:33:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:10,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:10,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:10,062 INFO L87 Difference]: Start difference. First operand 8972 states and 12862 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-07 00:33:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:10,115 INFO L93 Difference]: Finished difference Result 25968 states and 37088 transitions. [2024-11-07 00:33:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-07 00:33:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:10,142 INFO L225 Difference]: With dead ends: 25968 [2024-11-07 00:33:10,142 INFO L226 Difference]: Without dead ends: 17118 [2024-11-07 00:33:10,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:10,153 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 76 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:10,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 409 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17118 states. [2024-11-07 00:33:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17118 to 16412. [2024-11-07 00:33:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16412 states, 16411 states have (on average 1.4199012857229907) internal successors, (23302), 16411 states have internal predecessors, (23302), 0 states have call successors, (0), 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-11-07 00:33:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 23302 transitions. [2024-11-07 00:33:10,432 INFO L78 Accepts]: Start accepts. Automaton has 16412 states and 23302 transitions. Word has length 117 [2024-11-07 00:33:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:10,432 INFO L471 AbstractCegarLoop]: Abstraction has 16412 states and 23302 transitions. [2024-11-07 00:33:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-07 00:33:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16412 states and 23302 transitions. [2024-11-07 00:33:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:33:10,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:10,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:10,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 00:33:10,433 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1786344024, now seen corresponding path program 1 times [2024-11-07 00:33:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451357213] [2024-11-07 00:33:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:10,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:10,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451357213] [2024-11-07 00:33:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451357213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229643802] [2024-11-07 00:33:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:10,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:10,507 INFO L87 Difference]: Start difference. First operand 16412 states and 23302 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-11-07 00:33:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:10,587 INFO L93 Difference]: Finished difference Result 47584 states and 67176 transitions. [2024-11-07 00:33:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:10,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-07 00:33:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:10,634 INFO L225 Difference]: With dead ends: 47584 [2024-11-07 00:33:10,634 INFO L226 Difference]: Without dead ends: 31294 [2024-11-07 00:33:10,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:10,653 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 66 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:10,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 409 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31294 states. [2024-11-07 00:33:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31294 to 29884. [2024-11-07 00:33:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29884 states, 29883 states have (on average 1.4019342100860022) internal successors, (41894), 29883 states have internal predecessors, (41894), 0 states have call successors, (0), 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-11-07 00:33:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 41894 transitions. [2024-11-07 00:33:11,127 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 41894 transitions. Word has length 118 [2024-11-07 00:33:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:11,127 INFO L471 AbstractCegarLoop]: Abstraction has 29884 states and 41894 transitions. [2024-11-07 00:33:11,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-11-07 00:33:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 41894 transitions. [2024-11-07 00:33:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:33:11,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:11,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 00:33:11,128 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 880608737, now seen corresponding path program 1 times [2024-11-07 00:33:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263102141] [2024-11-07 00:33:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263102141] [2024-11-07 00:33:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263102141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:33:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680088328] [2024-11-07 00:33:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:11,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:33:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:11,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:33:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:33:11,430 INFO L87 Difference]: Start difference. First operand 29884 states and 41894 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-07 00:33:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:11,541 INFO L93 Difference]: Finished difference Result 30846 states and 43175 transitions. [2024-11-07 00:33:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:33:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-07 00:33:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:11,604 INFO L225 Difference]: With dead ends: 30846 [2024-11-07 00:33:11,605 INFO L226 Difference]: Without dead ends: 30844 [2024-11-07 00:33:11,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:33:11,617 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 934 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30844 states. [2024-11-07 00:33:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30844 to 30844. [2024-11-07 00:33:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30844 states, 30843 states have (on average 1.3831987809227377) internal successors, (42662), 30843 states have internal predecessors, (42662), 0 states have call successors, (0), 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-11-07 00:33:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30844 states to 30844 states and 42662 transitions. [2024-11-07 00:33:12,106 INFO L78 Accepts]: Start accepts. Automaton has 30844 states and 42662 transitions. Word has length 119 [2024-11-07 00:33:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:12,106 INFO L471 AbstractCegarLoop]: Abstraction has 30844 states and 42662 transitions. [2024-11-07 00:33:12,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-07 00:33:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30844 states and 42662 transitions. [2024-11-07 00:33:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:33:12,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:12,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:12,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 00:33:12,108 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:12,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1221320670, now seen corresponding path program 1 times [2024-11-07 00:33:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626511491] [2024-11-07 00:33:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:12,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626511491] [2024-11-07 00:33:12,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626511491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:12,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271688703] [2024-11-07 00:33:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:12,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:12,330 INFO L87 Difference]: Start difference. First operand 30844 states and 42662 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-07 00:33:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:12,586 INFO L93 Difference]: Finished difference Result 58856 states and 81708 transitions. [2024-11-07 00:33:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-07 00:33:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:12,662 INFO L225 Difference]: With dead ends: 58856 [2024-11-07 00:33:12,662 INFO L226 Difference]: Without dead ends: 53254 [2024-11-07 00:33:12,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:12,687 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1188 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:12,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1122 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53254 states. [2024-11-07 00:33:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53254 to 36444. [2024-11-07 00:33:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36444 states, 36443 states have (on average 1.3831462832368355) internal successors, (50406), 36443 states have internal predecessors, (50406), 0 states have call successors, (0), 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-11-07 00:33:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 50406 transitions. [2024-11-07 00:33:13,230 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 50406 transitions. Word has length 119 [2024-11-07 00:33:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 36444 states and 50406 transitions. [2024-11-07 00:33:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-07 00:33:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 50406 transitions. [2024-11-07 00:33:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:33:13,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:13,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-07 00:33:13,231 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1777695494, now seen corresponding path program 1 times [2024-11-07 00:33:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214285952] [2024-11-07 00:33:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214285952] [2024-11-07 00:33:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214285952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2242613] [2024-11-07 00:33:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:13,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:13,364 INFO L87 Difference]: Start difference. First operand 36444 states and 50406 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-11-07 00:33:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:13,666 INFO L93 Difference]: Finished difference Result 94528 states and 130536 transitions. [2024-11-07 00:33:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-07 00:33:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:13,729 INFO L225 Difference]: With dead ends: 94528 [2024-11-07 00:33:13,730 INFO L226 Difference]: Without dead ends: 58206 [2024-11-07 00:33:13,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:13,751 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:13,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58206 states. [2024-11-07 00:33:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58206 to 54876. [2024-11-07 00:33:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54876 states, 54875 states have (on average 1.3640820045558086) internal successors, (74854), 54875 states have internal predecessors, (74854), 0 states have call successors, (0), 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-11-07 00:33:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54876 states to 54876 states and 74854 transitions. [2024-11-07 00:33:14,309 INFO L78 Accepts]: Start accepts. Automaton has 54876 states and 74854 transitions. Word has length 120 [2024-11-07 00:33:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:14,309 INFO L471 AbstractCegarLoop]: Abstraction has 54876 states and 74854 transitions. [2024-11-07 00:33:14,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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-11-07 00:33:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 54876 states and 74854 transitions. [2024-11-07 00:33:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 00:33:14,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:14,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:33:14,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-07 00:33:14,315 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1132154545, now seen corresponding path program 1 times [2024-11-07 00:33:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382755088] [2024-11-07 00:33:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382755088] [2024-11-07 00:33:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382755088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453541610] [2024-11-07 00:33:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:14,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:14,437 INFO L87 Difference]: Start difference. First operand 54876 states and 74854 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:14,772 INFO L93 Difference]: Finished difference Result 109632 states and 149576 transitions. [2024-11-07 00:33:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-07 00:33:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:14,835 INFO L225 Difference]: With dead ends: 109632 [2024-11-07 00:33:14,835 INFO L226 Difference]: Without dead ends: 54878 [2024-11-07 00:33:14,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:14,869 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:14,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 382 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2024-11-07 00:33:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 54876. [2024-11-07 00:33:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54876 states, 54875 states have (on average 1.3489202733485193) internal successors, (74022), 54875 states have internal predecessors, (74022), 0 states have call successors, (0), 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-11-07 00:33:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54876 states to 54876 states and 74022 transitions. [2024-11-07 00:33:15,417 INFO L78 Accepts]: Start accepts. Automaton has 54876 states and 74022 transitions. Word has length 150 [2024-11-07 00:33:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:15,417 INFO L471 AbstractCegarLoop]: Abstraction has 54876 states and 74022 transitions. [2024-11-07 00:33:15,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 54876 states and 74022 transitions. [2024-11-07 00:33:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 00:33:15,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:15,422 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:33:15,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-07 00:33:15,422 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:15,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1845946094, now seen corresponding path program 1 times [2024-11-07 00:33:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791056221] [2024-11-07 00:33:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791056221] [2024-11-07 00:33:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791056221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:33:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305408805] [2024-11-07 00:33:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:15,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:33:15,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:33:15,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:33:15,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:33:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:16,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 00:33:16,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:33:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:17,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:33:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305408805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:33:18,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:33:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-07 00:33:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168088104] [2024-11-07 00:33:18,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:33:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 00:33:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 00:33:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-11-07 00:33:18,730 INFO L87 Difference]: Start difference. First operand 54876 states and 74022 transitions. Second operand has 29 states, 29 states have (on average 13.793103448275861) internal successors, (400), 28 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)