./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:40:15,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:40:15,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:40:15,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:40:15,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:40:15,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:40:15,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:40:15,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:40:15,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:40:15,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:40:16,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:40:16,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:40:16,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:40:16,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:40:16,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:40:16,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:40:16,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:40:16,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:40:16,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:40:16,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:40:16,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:40:16,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:40:16,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:40:16,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:40:16,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:40:16,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:40:16,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:40:16,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:40:16,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:40:16,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:40:16,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:40:16,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:40:16,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:40:16,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:40:16,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:40:16,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:40:16,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:40:16,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:40:16,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:40:16,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:40:16,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:40:16,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:40:16,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 [2024-11-11 21:40:16,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:40:16,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:40:16,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:40:16,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:40:16,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:40:16,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-11 21:40:17,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:40:18,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:40:18,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-11 21:40:18,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0ef03e7/9427b787dd514856a76b45daed3eb574/FLAG2704ffd08 [2024-11-11 21:40:18,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0ef03e7/9427b787dd514856a76b45daed3eb574 [2024-11-11 21:40:18,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:40:18,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:40:18,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:40:18,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:40:18,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:40:18,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:40:18" (1/1) ... [2024-11-11 21:40:18,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12416032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:18, skipping insertion in model container [2024-11-11 21:40:18,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:40:18" (1/1) ... [2024-11-11 21:40:18,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:40:18,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2024-11-11 21:40:18,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2024-11-11 21:40:18,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2024-11-11 21:40:18,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2024-11-11 21:40:18,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2024-11-11 21:40:18,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2024-11-11 21:40:18,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2024-11-11 21:40:18,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2024-11-11 21:40:18,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2024-11-11 21:40:18,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2024-11-11 21:40:18,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2024-11-11 21:40:18,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:40:18,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:40:18,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2024-11-11 21:40:18,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2024-11-11 21:40:18,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2024-11-11 21:40:18,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2024-11-11 21:40:18,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2024-11-11 21:40:18,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2024-11-11 21:40:18,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2024-11-11 21:40:18,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2024-11-11 21:40:18,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2024-11-11 21:40:18,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2024-11-11 21:40:18,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2024-11-11 21:40:19,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:40:19,041 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:40:19,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19 WrapperNode [2024-11-11 21:40:19,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:40:19,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:40:19,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:40:19,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:40:19,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,187 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2022 [2024-11-11 21:40:19,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:40:19,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:40:19,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:40:19,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:40:19,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,259 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-11 21:40:19,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:40:19,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:40:19,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:40:19,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:40:19,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (1/1) ... [2024-11-11 21:40:19,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:40:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:19,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:40:19,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:40:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:40:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:40:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:40:19,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:40:19,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:40:19,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:40:21,170 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2024-11-11 21:40:21,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:40:21,200 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:40:21,204 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:40:21,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:40:21 BoogieIcfgContainer [2024-11-11 21:40:21,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:40:21,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:40:21,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:40:21,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:40:21,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:40:18" (1/3) ... [2024-11-11 21:40:21,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361eb130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:40:21, skipping insertion in model container [2024-11-11 21:40:21,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:19" (2/3) ... [2024-11-11 21:40:21,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361eb130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:40:21, skipping insertion in model container [2024-11-11 21:40:21,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:40:21" (3/3) ... [2024-11-11 21:40:21,216 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-11 21:40:21,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:40:21,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-11 21:40:21,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:40:21,326 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;@9337d38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:40:21,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-11 21:40:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 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-11 21:40:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 21:40:21,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:21,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:21,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2024-11-11 21:40:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112735424] [2024-11-11 21:40:21,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:22,001 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-11 21:40:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112735424] [2024-11-11 21:40:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112735424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727670221] [2024-11-11 21:40:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:22,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:22,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:22,041 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-11 21:40:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:22,537 INFO L93 Difference]: Finished difference Result 704 states and 1191 transitions. [2024-11-11 21:40:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-11 21:40:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:22,558 INFO L225 Difference]: With dead ends: 704 [2024-11-11 21:40:22,559 INFO L226 Difference]: Without dead ends: 428 [2024-11-11 21:40:22,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:22,569 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1877 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1877 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:22,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1877 Valid, 500 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-11 21:40:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 386. [2024-11-11 21:40:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 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-11 21:40:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 508 transitions. [2024-11-11 21:40:22,632 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 508 transitions. Word has length 59 [2024-11-11 21:40:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 508 transitions. [2024-11-11 21:40:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-11 21:40:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 508 transitions. [2024-11-11 21:40:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 21:40:22,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:22,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:40:22,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2024-11-11 21:40:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111005782] [2024-11-11 21:40:22,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:22,893 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-11 21:40:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111005782] [2024-11-11 21:40:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111005782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240958010] [2024-11-11 21:40:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:22,901 INFO L87 Difference]: Start difference. First operand 386 states and 508 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-11 21:40:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:23,141 INFO L93 Difference]: Finished difference Result 681 states and 918 transitions. [2024-11-11 21:40:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:23,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-11 21:40:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:23,145 INFO L225 Difference]: With dead ends: 681 [2024-11-11 21:40:23,146 INFO L226 Difference]: Without dead ends: 366 [2024-11-11 21:40:23,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:23,152 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 953 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:23,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 210 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-11 21:40:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-11 21:40:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-11 21:40:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 482 transitions. [2024-11-11 21:40:23,183 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 482 transitions. Word has length 60 [2024-11-11 21:40:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:23,184 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 482 transitions. [2024-11-11 21:40:23,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-11 21:40:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2024-11-11 21:40:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 21:40:23,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:23,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:23,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:40:23,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2024-11-11 21:40:23,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380979067] [2024-11-11 21:40:23,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:23,372 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-11 21:40:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380979067] [2024-11-11 21:40:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380979067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704913662] [2024-11-11 21:40:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:23,377 INFO L87 Difference]: Start difference. First operand 366 states and 482 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-11 21:40:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:23,556 INFO L93 Difference]: Finished difference Result 661 states and 890 transitions. [2024-11-11 21:40:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-11 21:40:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:23,558 INFO L225 Difference]: With dead ends: 661 [2024-11-11 21:40:23,558 INFO L226 Difference]: Without dead ends: 347 [2024-11-11 21:40:23,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:23,560 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 913 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:23,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 199 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-11 21:40:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-11 21:40:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 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-11 21:40:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 459 transitions. [2024-11-11 21:40:23,579 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 459 transitions. Word has length 61 [2024-11-11 21:40:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:23,579 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 459 transitions. [2024-11-11 21:40:23,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-11 21:40:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2024-11-11 21:40:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 21:40:23,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:23,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:23,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:40:23,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:23,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 55190193, now seen corresponding path program 1 times [2024-11-11 21:40:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:23,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795974203] [2024-11-11 21:40:23,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:23,783 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-11 21:40:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795974203] [2024-11-11 21:40:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795974203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:23,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583908738] [2024-11-11 21:40:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:23,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:23,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:23,785 INFO L87 Difference]: Start difference. First operand 347 states and 459 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-11 21:40:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:23,973 INFO L93 Difference]: Finished difference Result 642 states and 865 transitions. [2024-11-11 21:40:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-11 21:40:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:23,976 INFO L225 Difference]: With dead ends: 642 [2024-11-11 21:40:23,976 INFO L226 Difference]: Without dead ends: 339 [2024-11-11 21:40:23,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:23,978 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 870 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:23,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 195 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-11 21:40:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-11-11 21:40:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-11 21:40:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2024-11-11 21:40:23,989 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 62 [2024-11-11 21:40:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:23,992 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2024-11-11 21:40:23,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-11 21:40:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2024-11-11 21:40:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:40:23,994 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:23,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:40:23,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:23,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2024-11-11 21:40:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642749018] [2024-11-11 21:40:23,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:24,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642749018] [2024-11-11 21:40:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642749018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184684610] [2024-11-11 21:40:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:24,364 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:24,936 INFO L93 Difference]: Finished difference Result 616 states and 826 transitions. [2024-11-11 21:40:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:40:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:24,940 INFO L225 Difference]: With dead ends: 616 [2024-11-11 21:40:24,941 INFO L226 Difference]: Without dead ends: 476 [2024-11-11 21:40:24,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:40:24,942 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1291 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:24,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 776 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-11 21:40:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 339. [2024-11-11 21:40:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 0 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-11 21:40:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2024-11-11 21:40:24,956 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 63 [2024-11-11 21:40:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:24,957 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2024-11-11 21:40:24,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2024-11-11 21:40:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:40:24,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:24,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:40:24,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2024-11-11 21:40:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186653152] [2024-11-11 21:40:24,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:25,345 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-11 21:40:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186653152] [2024-11-11 21:40:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186653152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180993566] [2024-11-11 21:40:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:25,352 INFO L87 Difference]: Start difference. First operand 339 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:25,935 INFO L93 Difference]: Finished difference Result 668 states and 907 transitions. [2024-11-11 21:40:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:40:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:25,938 INFO L225 Difference]: With dead ends: 668 [2024-11-11 21:40:25,938 INFO L226 Difference]: Without dead ends: 550 [2024-11-11 21:40:25,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:40:25,940 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1636 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:25,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 876 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-11 21:40:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 339. [2024-11-11 21:40:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-11 21:40:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2024-11-11 21:40:25,962 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 63 [2024-11-11 21:40:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:25,963 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2024-11-11 21:40:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2024-11-11 21:40:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:40:25,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:25,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:25,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:40:25,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2024-11-11 21:40:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107436047] [2024-11-11 21:40:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:26,294 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-11 21:40:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107436047] [2024-11-11 21:40:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107436047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:40:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031997618] [2024-11-11 21:40:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:26,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:40:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:40:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:40:26,296 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:26,748 INFO L93 Difference]: Finished difference Result 689 states and 911 transitions. [2024-11-11 21:40:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:40:26,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:40:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:26,751 INFO L225 Difference]: With dead ends: 689 [2024-11-11 21:40:26,751 INFO L226 Difference]: Without dead ends: 504 [2024-11-11 21:40:26,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:40:26,752 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1279 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:26,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 758 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-11 21:40:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 339. [2024-11-11 21:40:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-11 21:40:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 445 transitions. [2024-11-11 21:40:26,761 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 445 transitions. Word has length 63 [2024-11-11 21:40:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 445 transitions. [2024-11-11 21:40:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 445 transitions. [2024-11-11 21:40:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:26,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:26,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:26,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:40:26,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2024-11-11 21:40:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125854552] [2024-11-11 21:40:26,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:27,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-11 21:40:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125854552] [2024-11-11 21:40:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125854552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:27,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222997076] [2024-11-11 21:40:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:27,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:27,081 INFO L87 Difference]: Start difference. First operand 339 states and 445 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:27,606 INFO L93 Difference]: Finished difference Result 641 states and 861 transitions. [2024-11-11 21:40:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:27,609 INFO L225 Difference]: With dead ends: 641 [2024-11-11 21:40:27,609 INFO L226 Difference]: Without dead ends: 530 [2024-11-11 21:40:27,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:40:27,611 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1676 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:27,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 777 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-11 21:40:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 339. [2024-11-11 21:40:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-11 21:40:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 444 transitions. [2024-11-11 21:40:27,619 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 444 transitions. Word has length 65 [2024-11-11 21:40:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:27,619 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 444 transitions. [2024-11-11 21:40:27,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 444 transitions. [2024-11-11 21:40:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:27,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:27,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:40:27,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2024-11-11 21:40:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131899378] [2024-11-11 21:40:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:28,162 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-11 21:40:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131899378] [2024-11-11 21:40:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131899378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:40:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296041963] [2024-11-11 21:40:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:28,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:40:28,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:40:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:40:28,167 INFO L87 Difference]: Start difference. First operand 339 states and 444 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:29,126 INFO L93 Difference]: Finished difference Result 1033 states and 1436 transitions. [2024-11-11 21:40:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:40:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:29,130 INFO L225 Difference]: With dead ends: 1033 [2024-11-11 21:40:29,130 INFO L226 Difference]: Without dead ends: 910 [2024-11-11 21:40:29,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:40:29,132 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 3556 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3556 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:29,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3556 Valid, 944 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:40:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-11 21:40:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 343. [2024-11-11 21:40:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3493975903614457) internal successors, (448), 342 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-11 21:40:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 448 transitions. [2024-11-11 21:40:29,142 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 448 transitions. Word has length 65 [2024-11-11 21:40:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:29,142 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 448 transitions. [2024-11-11 21:40:29,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 448 transitions. [2024-11-11 21:40:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:29,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:29,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:29,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:40:29,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2024-11-11 21:40:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741385887] [2024-11-11 21:40:29,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:29,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-11 21:40:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741385887] [2024-11-11 21:40:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741385887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159971625] [2024-11-11 21:40:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:29,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:29,442 INFO L87 Difference]: Start difference. First operand 343 states and 448 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:29,933 INFO L93 Difference]: Finished difference Result 642 states and 861 transitions. [2024-11-11 21:40:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:29,936 INFO L225 Difference]: With dead ends: 642 [2024-11-11 21:40:29,936 INFO L226 Difference]: Without dead ends: 534 [2024-11-11 21:40:29,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:40:29,937 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1673 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:29,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 777 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:40:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-11 21:40:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2024-11-11 21:40:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3463855421686748) internal successors, (447), 342 states have internal predecessors, (447), 0 states have call successors, (0), 0 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-11 21:40:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 447 transitions. [2024-11-11 21:40:29,946 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 447 transitions. Word has length 65 [2024-11-11 21:40:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:29,946 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 447 transitions. [2024-11-11 21:40:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 447 transitions. [2024-11-11 21:40:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:29,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:29,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:29,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:40:29,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:29,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1375273345, now seen corresponding path program 1 times [2024-11-11 21:40:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756114000] [2024-11-11 21:40:29,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:30,219 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-11 21:40:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756114000] [2024-11-11 21:40:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756114000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606368921] [2024-11-11 21:40:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:30,222 INFO L87 Difference]: Start difference. First operand 343 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:30,675 INFO L93 Difference]: Finished difference Result 539 states and 704 transitions. [2024-11-11 21:40:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:40:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:30,678 INFO L225 Difference]: With dead ends: 539 [2024-11-11 21:40:30,679 INFO L226 Difference]: Without dead ends: 534 [2024-11-11 21:40:30,679 INFO L434 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-11 21:40:30,680 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1360 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:30,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 768 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:40:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-11 21:40:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2024-11-11 21:40:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3433734939759037) internal successors, (446), 342 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-11 21:40:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 446 transitions. [2024-11-11 21:40:30,687 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 446 transitions. Word has length 65 [2024-11-11 21:40:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:30,688 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 446 transitions. [2024-11-11 21:40:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2024-11-11 21:40:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:30,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:30,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:40:30,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -636059456, now seen corresponding path program 1 times [2024-11-11 21:40:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249147542] [2024-11-11 21:40:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:31,125 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-11 21:40:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249147542] [2024-11-11 21:40:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249147542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:40:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374162099] [2024-11-11 21:40:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:40:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:40:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:40:31,127 INFO L87 Difference]: Start difference. First operand 343 states and 446 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:31,814 INFO L93 Difference]: Finished difference Result 652 states and 885 transitions. [2024-11-11 21:40:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:40:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:31,817 INFO L225 Difference]: With dead ends: 652 [2024-11-11 21:40:31,817 INFO L226 Difference]: Without dead ends: 482 [2024-11-11 21:40:31,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:40:31,818 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1532 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:31,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1170 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:40:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-11 21:40:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 343. [2024-11-11 21:40:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3373493975903614) internal successors, (444), 342 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-11 21:40:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 444 transitions. [2024-11-11 21:40:31,826 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 444 transitions. Word has length 65 [2024-11-11 21:40:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:31,827 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 444 transitions. [2024-11-11 21:40:31,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 444 transitions. [2024-11-11 21:40:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:31,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:31,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:31,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:40:31,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:31,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2024-11-11 21:40:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403682807] [2024-11-11 21:40:31,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:32,083 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-11 21:40:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:32,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403682807] [2024-11-11 21:40:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403682807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094111289] [2024-11-11 21:40:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:32,085 INFO L87 Difference]: Start difference. First operand 343 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:32,542 INFO L93 Difference]: Finished difference Result 539 states and 700 transitions. [2024-11-11 21:40:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:32,544 INFO L225 Difference]: With dead ends: 539 [2024-11-11 21:40:32,544 INFO L226 Difference]: Without dead ends: 534 [2024-11-11 21:40:32,545 INFO L434 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-11 21:40:32,546 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1088 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:32,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 883 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:40:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-11 21:40:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2024-11-11 21:40:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3313253012048192) internal successors, (442), 342 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-11 21:40:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 442 transitions. [2024-11-11 21:40:32,555 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 442 transitions. Word has length 65 [2024-11-11 21:40:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:32,555 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 442 transitions. [2024-11-11 21:40:32,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 442 transitions. [2024-11-11 21:40:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:40:32,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:32,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:32,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:40:32,556 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:32,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2024-11-11 21:40:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961753829] [2024-11-11 21:40:32,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:32,811 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-11 21:40:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961753829] [2024-11-11 21:40:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961753829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304234686] [2024-11-11 21:40:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:32,814 INFO L87 Difference]: Start difference. First operand 343 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:33,358 INFO L93 Difference]: Finished difference Result 567 states and 742 transitions. [2024-11-11 21:40:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:40:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:33,360 INFO L225 Difference]: With dead ends: 567 [2024-11-11 21:40:33,361 INFO L226 Difference]: Without dead ends: 550 [2024-11-11 21:40:33,361 INFO L434 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-11 21:40:33,362 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1505 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:33,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 964 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-11 21:40:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 343. [2024-11-11 21:40:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3253012048192772) internal successors, (440), 342 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-11 21:40:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 440 transitions. [2024-11-11 21:40:33,372 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 440 transitions. Word has length 65 [2024-11-11 21:40:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:33,373 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 440 transitions. [2024-11-11 21:40:33,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 440 transitions. [2024-11-11 21:40:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:40:33,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:33,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:40:33,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -849466761, now seen corresponding path program 1 times [2024-11-11 21:40:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51737081] [2024-11-11 21:40:33,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:33,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-11 21:40:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:33,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51737081] [2024-11-11 21:40:33,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51737081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:33,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:33,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:33,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492982825] [2024-11-11 21:40:33,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:33,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:33,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:33,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:33,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:33,620 INFO L87 Difference]: Start difference. First operand 343 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:34,207 INFO L93 Difference]: Finished difference Result 673 states and 899 transitions. [2024-11-11 21:40:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:40:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:40:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:34,210 INFO L225 Difference]: With dead ends: 673 [2024-11-11 21:40:34,210 INFO L226 Difference]: Without dead ends: 550 [2024-11-11 21:40:34,212 INFO L434 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-11 21:40:34,213 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 939 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:34,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1119 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:40:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-11 21:40:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 339. [2024-11-11 21:40:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-11 21:40:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 435 transitions. [2024-11-11 21:40:34,222 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 435 transitions. Word has length 66 [2024-11-11 21:40:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:34,222 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 435 transitions. [2024-11-11 21:40:34,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 435 transitions. [2024-11-11 21:40:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:40:34,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:34,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:40:34,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -809481061, now seen corresponding path program 1 times [2024-11-11 21:40:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576908317] [2024-11-11 21:40:34,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:34,719 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-11 21:40:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576908317] [2024-11-11 21:40:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576908317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:40:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256652793] [2024-11-11 21:40:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:40:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:40:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:40:34,722 INFO L87 Difference]: Start difference. First operand 339 states and 435 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:35,143 INFO L93 Difference]: Finished difference Result 587 states and 784 transitions. [2024-11-11 21:40:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:40:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:40:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:35,145 INFO L225 Difference]: With dead ends: 587 [2024-11-11 21:40:35,145 INFO L226 Difference]: Without dead ends: 418 [2024-11-11 21:40:35,145 INFO L434 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-11 21:40:35,146 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 868 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1007 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-11 21:40:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2024-11-11 21:40:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.3308550185873607) internal successors, (358), 275 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-11 21:40:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 358 transitions. [2024-11-11 21:40:35,153 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 358 transitions. Word has length 67 [2024-11-11 21:40:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:35,153 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 358 transitions. [2024-11-11 21:40:35,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 358 transitions. [2024-11-11 21:40:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:40:35,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:35,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:35,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:40:35,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash -827796874, now seen corresponding path program 1 times [2024-11-11 21:40:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910624574] [2024-11-11 21:40:35,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:36,614 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-11 21:40:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910624574] [2024-11-11 21:40:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910624574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:36,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:36,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-11 21:40:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533961770] [2024-11-11 21:40:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:36,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:40:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:40:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:40:36,617 INFO L87 Difference]: Start difference. First operand 276 states and 358 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:38,334 INFO L93 Difference]: Finished difference Result 544 states and 733 transitions. [2024-11-11 21:40:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 21:40:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:40:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:38,336 INFO L225 Difference]: With dead ends: 544 [2024-11-11 21:40:38,336 INFO L226 Difference]: Without dead ends: 434 [2024-11-11 21:40:38,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:40:38,337 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 764 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:38,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 2257 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:40:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-11 21:40:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 286. [2024-11-11 21:40:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 279 states have (on average 1.3369175627240144) internal successors, (373), 285 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-11 21:40:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 373 transitions. [2024-11-11 21:40:38,345 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 373 transitions. Word has length 67 [2024-11-11 21:40:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:38,345 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 373 transitions. [2024-11-11 21:40:38,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 373 transitions. [2024-11-11 21:40:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:40:38,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:38,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:38,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:40:38,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 455689729, now seen corresponding path program 1 times [2024-11-11 21:40:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286538813] [2024-11-11 21:40:38,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:39,327 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-11 21:40:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286538813] [2024-11-11 21:40:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286538813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 21:40:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723183475] [2024-11-11 21:40:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 21:40:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 21:40:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:40:39,330 INFO L87 Difference]: Start difference. First operand 286 states and 373 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:40,969 INFO L93 Difference]: Finished difference Result 636 states and 852 transitions. [2024-11-11 21:40:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:40:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:40:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:40,972 INFO L225 Difference]: With dead ends: 636 [2024-11-11 21:40:40,972 INFO L226 Difference]: Without dead ends: 632 [2024-11-11 21:40:40,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:40:40,973 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1334 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:40,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2339 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:40:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-11 21:40:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 292. [2024-11-11 21:40:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.3368421052631578) internal successors, (381), 291 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-11 21:40:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 381 transitions. [2024-11-11 21:40:40,981 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 381 transitions. Word has length 67 [2024-11-11 21:40:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 381 transitions. [2024-11-11 21:40:40,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 381 transitions. [2024-11-11 21:40:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:40:40,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:40,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:40,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:40:40,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:40,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1324827419, now seen corresponding path program 1 times [2024-11-11 21:40:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048653518] [2024-11-11 21:40:40,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:41,424 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-11 21:40:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048653518] [2024-11-11 21:40:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048653518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:40:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323733254] [2024-11-11 21:40:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:40:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:40:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:40:41,426 INFO L87 Difference]: Start difference. First operand 292 states and 381 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:41,747 INFO L93 Difference]: Finished difference Result 398 states and 539 transitions. [2024-11-11 21:40:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:40:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:41,749 INFO L225 Difference]: With dead ends: 398 [2024-11-11 21:40:41,749 INFO L226 Difference]: Without dead ends: 244 [2024-11-11 21:40:41,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:40:41,750 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 451 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:41,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 982 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-11 21:40:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-11 21:40:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.3375) internal successors, (321), 243 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-11 21:40:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 321 transitions. [2024-11-11 21:40:41,755 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 321 transitions. Word has length 67 [2024-11-11 21:40:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:41,755 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 321 transitions. [2024-11-11 21:40:41,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 321 transitions. [2024-11-11 21:40:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:40:41,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:41,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:41,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:40:41,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -922376210, now seen corresponding path program 1 times [2024-11-11 21:40:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656565507] [2024-11-11 21:40:41,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:42,255 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-11 21:40:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656565507] [2024-11-11 21:40:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656565507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:40:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501352788] [2024-11-11 21:40:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:42,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:40:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:40:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:40:42,258 INFO L87 Difference]: Start difference. First operand 244 states and 321 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:42,822 INFO L93 Difference]: Finished difference Result 736 states and 1025 transitions. [2024-11-11 21:40:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:40:42,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 21:40:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:42,825 INFO L225 Difference]: With dead ends: 736 [2024-11-11 21:40:42,825 INFO L226 Difference]: Without dead ends: 624 [2024-11-11 21:40:42,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:40:42,826 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 932 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:42,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1362 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-11 21:40:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 224. [2024-11-11 21:40:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 223 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-11 21:40:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2024-11-11 21:40:42,833 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 68 [2024-11-11 21:40:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:42,834 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2024-11-11 21:40:42,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2024-11-11 21:40:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:40:42,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:42,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:40:42,835 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 823611388, now seen corresponding path program 1 times [2024-11-11 21:40:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768154716] [2024-11-11 21:40:42,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:43,050 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-11 21:40:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768154716] [2024-11-11 21:40:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768154716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:43,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339671066] [2024-11-11 21:40:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:43,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:43,054 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:43,371 INFO L93 Difference]: Finished difference Result 373 states and 496 transitions. [2024-11-11 21:40:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:40:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 21:40:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:43,373 INFO L225 Difference]: With dead ends: 373 [2024-11-11 21:40:43,373 INFO L226 Difference]: Without dead ends: 366 [2024-11-11 21:40:43,373 INFO L434 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-11 21:40:43,374 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1020 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:43,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 443 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:40:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-11 21:40:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 224. [2024-11-11 21:40:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.3122171945701357) internal successors, (290), 223 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-11 21:40:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 290 transitions. [2024-11-11 21:40:43,381 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 290 transitions. Word has length 68 [2024-11-11 21:40:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:43,381 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 290 transitions. [2024-11-11 21:40:43,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 290 transitions. [2024-11-11 21:40:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:40:43,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:43,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:43,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:40:43,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 520441226, now seen corresponding path program 1 times [2024-11-11 21:40:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592675521] [2024-11-11 21:40:43,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:43,638 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-11 21:40:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:43,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592675521] [2024-11-11 21:40:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592675521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:43,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:40:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453900482] [2024-11-11 21:40:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:40:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:40:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:43,640 INFO L87 Difference]: Start difference. First operand 224 states and 290 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:44,010 INFO L93 Difference]: Finished difference Result 526 states and 712 transitions. [2024-11-11 21:40:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:40:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 21:40:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:44,011 INFO L225 Difference]: With dead ends: 526 [2024-11-11 21:40:44,012 INFO L226 Difference]: Without dead ends: 390 [2024-11-11 21:40:44,012 INFO L434 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-11 21:40:44,013 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 370 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:44,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 726 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:40:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-11 21:40:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 224. [2024-11-11 21:40:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.3031674208144797) internal successors, (288), 223 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-11 21:40:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2024-11-11 21:40:44,019 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 68 [2024-11-11 21:40:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:44,019 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2024-11-11 21:40:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2024-11-11 21:40:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:40:44,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:44,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:40:44,021 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1997555533, now seen corresponding path program 1 times [2024-11-11 21:40:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671542494] [2024-11-11 21:40:44,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:44,530 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-11 21:40:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671542494] [2024-11-11 21:40:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671542494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:44,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:40:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133638256] [2024-11-11 21:40:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:44,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:40:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:44,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:40:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:40:44,532 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-11 21:40:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:45,144 INFO L93 Difference]: Finished difference Result 604 states and 829 transitions. [2024-11-11 21:40:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:40:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-11 21:40:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:45,146 INFO L225 Difference]: With dead ends: 604 [2024-11-11 21:40:45,146 INFO L226 Difference]: Without dead ends: 598 [2024-11-11 21:40:45,147 INFO L434 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-11 21:40:45,147 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 849 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:45,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1915 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:40:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-11 21:40:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 218. [2024-11-11 21:40:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3009259259259258) internal successors, (281), 217 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-11 21:40:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2024-11-11 21:40:45,157 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 70 [2024-11-11 21:40:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:45,157 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2024-11-11 21:40:45,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-11 21:40:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2024-11-11 21:40:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:40:45,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:45,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:40:45,160 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1662348756, now seen corresponding path program 1 times [2024-11-11 21:40:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679922619] [2024-11-11 21:40:45,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:46,308 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-11 21:40:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679922619] [2024-11-11 21:40:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679922619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-11 21:40:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859939111] [2024-11-11 21:40:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:40:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:40:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:40:46,310 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-11 21:40:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:47,500 INFO L93 Difference]: Finished difference Result 236 states and 301 transitions. [2024-11-11 21:40:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 21:40:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-11 21:40:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:47,501 INFO L225 Difference]: With dead ends: 236 [2024-11-11 21:40:47,501 INFO L226 Difference]: Without dead ends: 228 [2024-11-11 21:40:47,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 21:40:47,503 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 361 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:47,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1578 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:40:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-11 21:40:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2024-11-11 21:40:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 226 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-11 21:40:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2024-11-11 21:40:47,508 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 70 [2024-11-11 21:40:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2024-11-11 21:40:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-11 21:40:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2024-11-11 21:40:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:40:47,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:47,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:47,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:40:47,510 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1776801356, now seen corresponding path program 1 times [2024-11-11 21:40:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910735554] [2024-11-11 21:40:47,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:47,973 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-11 21:40:47,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910735554] [2024-11-11 21:40:47,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910735554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:47,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:47,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:40:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173529267] [2024-11-11 21:40:47,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:47,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:40:47,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:40:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:40:47,978 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-11 21:40:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:48,439 INFO L93 Difference]: Finished difference Result 365 states and 488 transitions. [2024-11-11 21:40:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:40:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-11 21:40:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:48,441 INFO L225 Difference]: With dead ends: 365 [2024-11-11 21:40:48,441 INFO L226 Difference]: Without dead ends: 350 [2024-11-11 21:40:48,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:40:48,442 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 586 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:48,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1119 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-11 21:40:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 206. [2024-11-11 21:40:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-11 21:40:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 267 transitions. [2024-11-11 21:40:48,451 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 267 transitions. Word has length 71 [2024-11-11 21:40:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 267 transitions. [2024-11-11 21:40:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-11 21:40:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2024-11-11 21:40:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:40:48,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:48,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:48,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:40:48,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 161471129, now seen corresponding path program 1 times [2024-11-11 21:40:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270957122] [2024-11-11 21:40:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:48,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-11 21:40:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270957122] [2024-11-11 21:40:48,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270957122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:48,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:48,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638571482] [2024-11-11 21:40:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:48,571 INFO L87 Difference]: Start difference. First operand 206 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:48,712 INFO L93 Difference]: Finished difference Result 1054 states and 1531 transitions. [2024-11-11 21:40:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:40:48,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-11 21:40:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:48,715 INFO L225 Difference]: With dead ends: 1054 [2024-11-11 21:40:48,716 INFO L226 Difference]: Without dead ends: 948 [2024-11-11 21:40:48,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:40:48,717 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 843 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:48,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1274 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-11 21:40:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 310. [2024-11-11 21:40:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 0 states have call successors, (0), 0 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-11 21:40:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2024-11-11 21:40:48,733 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 93 [2024-11-11 21:40:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:48,733 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2024-11-11 21:40:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2024-11-11 21:40:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:48,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:48,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:40:48,735 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -880942767, now seen corresponding path program 1 times [2024-11-11 21:40:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525295634] [2024-11-11 21:40:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:48,851 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-11 21:40:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525295634] [2024-11-11 21:40:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525295634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733695437] [2024-11-11 21:40:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:48,853 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:48,946 INFO L93 Difference]: Finished difference Result 1256 states and 1818 transitions. [2024-11-11 21:40:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:48,950 INFO L225 Difference]: With dead ends: 1256 [2024-11-11 21:40:48,951 INFO L226 Difference]: Without dead ends: 1046 [2024-11-11 21:40:48,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:48,952 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 648 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:48,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 777 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-11 21:40:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 518. [2024-11-11 21:40:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4081237911025144) internal successors, (728), 517 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-11 21:40:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 728 transitions. [2024-11-11 21:40:48,966 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 728 transitions. Word has length 95 [2024-11-11 21:40:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:48,966 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 728 transitions. [2024-11-11 21:40:48,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 728 transitions. [2024-11-11 21:40:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:48,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:48,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:48,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:40:48,968 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 284809815, now seen corresponding path program 1 times [2024-11-11 21:40:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177196591] [2024-11-11 21:40:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:49,093 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-11 21:40:49,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177196591] [2024-11-11 21:40:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177196591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:49,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433654057] [2024-11-11 21:40:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:49,096 INFO L87 Difference]: Start difference. First operand 518 states and 728 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:49,191 INFO L93 Difference]: Finished difference Result 1464 states and 2126 transitions. [2024-11-11 21:40:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:49,195 INFO L225 Difference]: With dead ends: 1464 [2024-11-11 21:40:49,196 INFO L226 Difference]: Without dead ends: 1254 [2024-11-11 21:40:49,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:49,197 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 648 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:49,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 719 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-11 21:40:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 830. [2024-11-11 21:40:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4342581423401688) internal successors, (1189), 829 states have internal predecessors, (1189), 0 states have call successors, (0), 0 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-11 21:40:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1189 transitions. [2024-11-11 21:40:49,212 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1189 transitions. Word has length 95 [2024-11-11 21:40:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:49,213 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1189 transitions. [2024-11-11 21:40:49,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1189 transitions. [2024-11-11 21:40:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:49,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:49,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:49,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:40:49,214 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:49,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -736748582, now seen corresponding path program 1 times [2024-11-11 21:40:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080490178] [2024-11-11 21:40:49,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:49,384 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-11 21:40:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080490178] [2024-11-11 21:40:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080490178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632266140] [2024-11-11 21:40:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:49,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:49,387 INFO L87 Difference]: Start difference. First operand 830 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:49,477 INFO L93 Difference]: Finished difference Result 1562 states and 2270 transitions. [2024-11-11 21:40:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:49,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:49,481 INFO L225 Difference]: With dead ends: 1562 [2024-11-11 21:40:49,481 INFO L226 Difference]: Without dead ends: 832 [2024-11-11 21:40:49,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:40:49,484 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:49,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 456 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-11-11 21:40:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2024-11-11 21:40:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4246079613992761) internal successors, (1181), 829 states have internal predecessors, (1181), 0 states have call successors, (0), 0 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-11 21:40:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1181 transitions. [2024-11-11 21:40:49,501 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1181 transitions. Word has length 95 [2024-11-11 21:40:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:49,501 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1181 transitions. [2024-11-11 21:40:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1181 transitions. [2024-11-11 21:40:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:49,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:49,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:49,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:40:49,503 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:49,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1506041575, now seen corresponding path program 1 times [2024-11-11 21:40:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:49,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642891436] [2024-11-11 21:40:49,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:49,582 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-11 21:40:49,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642891436] [2024-11-11 21:40:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642891436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382156931] [2024-11-11 21:40:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:49,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:49,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:49,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:49,585 INFO L87 Difference]: Start difference. First operand 830 states and 1181 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:49,614 INFO L93 Difference]: Finished difference Result 2200 states and 3175 transitions. [2024-11-11 21:40:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:49,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:49,620 INFO L225 Difference]: With dead ends: 2200 [2024-11-11 21:40:49,620 INFO L226 Difference]: Without dead ends: 1470 [2024-11-11 21:40:49,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:49,623 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:49,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 368 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-11-11 21:40:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1468. [2024-11-11 21:40:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 1.4137695978186775) internal successors, (2074), 1467 states have internal predecessors, (2074), 0 states have call successors, (0), 0 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-11 21:40:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2074 transitions. [2024-11-11 21:40:49,661 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2074 transitions. Word has length 95 [2024-11-11 21:40:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:49,661 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2074 transitions. [2024-11-11 21:40:49,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2074 transitions. [2024-11-11 21:40:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:49,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:49,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:40:49,664 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:49,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1675387619, now seen corresponding path program 1 times [2024-11-11 21:40:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859305119] [2024-11-11 21:40:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:49,836 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-11 21:40:49,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859305119] [2024-11-11 21:40:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859305119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790150375] [2024-11-11 21:40:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:49,838 INFO L87 Difference]: Start difference. First operand 1468 states and 2074 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:49,927 INFO L93 Difference]: Finished difference Result 3038 states and 4335 transitions. [2024-11-11 21:40:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:49,935 INFO L225 Difference]: With dead ends: 3038 [2024-11-11 21:40:49,935 INFO L226 Difference]: Without dead ends: 2646 [2024-11-11 21:40:49,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:49,938 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 614 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:49,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 767 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2024-11-11 21:40:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 1858. [2024-11-11 21:40:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.4184168012924072) internal successors, (2634), 1857 states have internal predecessors, (2634), 0 states have call successors, (0), 0 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-11 21:40:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2634 transitions. [2024-11-11 21:40:49,974 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2634 transitions. Word has length 95 [2024-11-11 21:40:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2634 transitions. [2024-11-11 21:40:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2634 transitions. [2024-11-11 21:40:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:40:49,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:49,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 21:40:49,976 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1554031907, now seen corresponding path program 1 times [2024-11-11 21:40:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230704254] [2024-11-11 21:40:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,093 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-11 21:40:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230704254] [2024-11-11 21:40:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230704254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437030985] [2024-11-11 21:40:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:50,095 INFO L87 Difference]: Start difference. First operand 1858 states and 2634 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:50,184 INFO L93 Difference]: Finished difference Result 3428 states and 4895 transitions. [2024-11-11 21:40:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-11 21:40:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:50,194 INFO L225 Difference]: With dead ends: 3428 [2024-11-11 21:40:50,195 INFO L226 Difference]: Without dead ends: 3036 [2024-11-11 21:40:50,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:50,197 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 583 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:50,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 816 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2024-11-11 21:40:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2248. [2024-11-11 21:40:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 1.4214508233199823) internal successors, (3194), 2247 states have internal predecessors, (3194), 0 states have call successors, (0), 0 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-11 21:40:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3194 transitions. [2024-11-11 21:40:50,238 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3194 transitions. Word has length 95 [2024-11-11 21:40:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3194 transitions. [2024-11-11 21:40:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3194 transitions. [2024-11-11 21:40:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 21:40:50,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:50,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 21:40:50,240 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1423537109, now seen corresponding path program 1 times [2024-11-11 21:40:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439742934] [2024-11-11 21:40:50,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,340 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-11 21:40:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439742934] [2024-11-11 21:40:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439742934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437991265] [2024-11-11 21:40:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,342 INFO L87 Difference]: Start difference. First operand 2248 states and 3194 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-11 21:40:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:50,371 INFO L93 Difference]: Finished difference Result 5708 states and 8130 transitions. [2024-11-11 21:40:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:50,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-11 21:40:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:50,382 INFO L225 Difference]: With dead ends: 5708 [2024-11-11 21:40:50,382 INFO L226 Difference]: Without dead ends: 3560 [2024-11-11 21:40:50,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,387 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 343 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-11 21:40:50,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2024-11-11 21:40:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3382. [2024-11-11 21:40:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3382 states, 3381 states have (on average 1.4072759538598048) internal successors, (4758), 3381 states have internal predecessors, (4758), 0 states have call successors, (0), 0 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-11 21:40:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4758 transitions. [2024-11-11 21:40:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4758 transitions. Word has length 96 [2024-11-11 21:40:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 3382 states and 4758 transitions. [2024-11-11 21:40:50,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-11 21:40:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4758 transitions. [2024-11-11 21:40:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:40:50,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:50,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:50,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:40:50,448 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1571382276, now seen corresponding path program 1 times [2024-11-11 21:40:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215002483] [2024-11-11 21:40:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,570 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-11 21:40:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215002483] [2024-11-11 21:40:50,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215002483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:50,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:50,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206198247] [2024-11-11 21:40:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,573 INFO L87 Difference]: Start difference. First operand 3382 states and 4758 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-11 21:40:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:50,616 INFO L93 Difference]: Finished difference Result 9682 states and 13594 transitions. [2024-11-11 21:40:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:50,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-11 21:40:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:50,637 INFO L225 Difference]: With dead ends: 9682 [2024-11-11 21:40:50,637 INFO L226 Difference]: Without dead ends: 6400 [2024-11-11 21:40:50,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,645 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 343 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-11 21:40:50,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6400 states. [2024-11-11 21:40:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6400 to 6134. [2024-11-11 21:40:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.393771400619599) internal successors, (8548), 6133 states have internal predecessors, (8548), 0 states have call successors, (0), 0 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-11 21:40:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8548 transitions. [2024-11-11 21:40:50,731 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8548 transitions. Word has length 97 [2024-11-11 21:40:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:50,731 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8548 transitions. [2024-11-11 21:40:50,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-11 21:40:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8548 transitions. [2024-11-11 21:40:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:40:50,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:50,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:40:50,733 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:50,734 INFO L85 PathProgramCache]: Analyzing trace with hash 584515800, now seen corresponding path program 1 times [2024-11-11 21:40:50,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:50,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019535823] [2024-11-11 21:40:50,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,842 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-11 21:40:50,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019535823] [2024-11-11 21:40:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019535823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129356889] [2024-11-11 21:40:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,845 INFO L87 Difference]: Start difference. First operand 6134 states and 8548 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-11 21:40:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:50,897 INFO L93 Difference]: Finished difference Result 17674 states and 24502 transitions. [2024-11-11 21:40:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-11 21:40:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:50,917 INFO L225 Difference]: With dead ends: 17674 [2024-11-11 21:40:50,918 INFO L226 Difference]: Without dead ends: 11640 [2024-11-11 21:40:50,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:50,928 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 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-11 21:40:50,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2024-11-11 21:40:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11110. [2024-11-11 21:40:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11110 states, 11109 states have (on average 1.3745611666216582) internal successors, (15270), 11109 states have internal predecessors, (15270), 0 states have call successors, (0), 0 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-11 21:40:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 15270 transitions. [2024-11-11 21:40:51,087 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 15270 transitions. Word has length 98 [2024-11-11 21:40:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:51,087 INFO L471 AbstractCegarLoop]: Abstraction has 11110 states and 15270 transitions. [2024-11-11 21:40:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-11 21:40:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 15270 transitions. [2024-11-11 21:40:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 21:40:51,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:51,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 21:40:51,089 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1344323197, now seen corresponding path program 1 times [2024-11-11 21:40:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657497857] [2024-11-11 21:40:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:51,221 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-11 21:40:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657497857] [2024-11-11 21:40:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657497857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177403820] [2024-11-11 21:40:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:51,223 INFO L87 Difference]: Start difference. First operand 11110 states and 15270 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-11 21:40:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:51,296 INFO L93 Difference]: Finished difference Result 32074 states and 43744 transitions. [2024-11-11 21:40:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-11 21:40:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:51,330 INFO L225 Difference]: With dead ends: 32074 [2024-11-11 21:40:51,331 INFO L226 Difference]: Without dead ends: 21064 [2024-11-11 21:40:51,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:51,347 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 54 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 340 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-11 21:40:51,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 340 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2024-11-11 21:40:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 20006. [2024-11-11 21:40:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20006 states, 20005 states have (on average 1.3495626093476631) internal successors, (26998), 20005 states have internal predecessors, (26998), 0 states have call successors, (0), 0 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-11 21:40:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 26998 transitions. [2024-11-11 21:40:51,621 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 26998 transitions. Word has length 99 [2024-11-11 21:40:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 20006 states and 26998 transitions. [2024-11-11 21:40:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-11 21:40:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 26998 transitions. [2024-11-11 21:40:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:40:51,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:51,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:51,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 21:40:51,623 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:51,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -445596435, now seen corresponding path program 1 times [2024-11-11 21:40:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585109961] [2024-11-11 21:40:51,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:51,917 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-11 21:40:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585109961] [2024-11-11 21:40:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585109961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765357615] [2024-11-11 21:40:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:51,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:51,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:51,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:51,918 INFO L87 Difference]: Start difference. First operand 20006 states and 26998 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 21:40:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:51,993 INFO L93 Difference]: Finished difference Result 20488 states and 27639 transitions. [2024-11-11 21:40:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-11 21:40:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:52,028 INFO L225 Difference]: With dead ends: 20488 [2024-11-11 21:40:52,029 INFO L226 Difference]: Without dead ends: 20486 [2024-11-11 21:40:52,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:52,039 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:52,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2024-11-11 21:40:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20486. [2024-11-11 21:40:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.3319990236758603) internal successors, (27286), 20485 states have internal predecessors, (27286), 0 states have call successors, (0), 0 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-11 21:40:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 27286 transitions. [2024-11-11 21:40:52,304 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 27286 transitions. Word has length 100 [2024-11-11 21:40:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:52,304 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 27286 transitions. [2024-11-11 21:40:52,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 21:40:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 27286 transitions. [2024-11-11 21:40:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:40:52,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:52,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 21:40:52,306 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:52,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1981290545, now seen corresponding path program 1 times [2024-11-11 21:40:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825203454] [2024-11-11 21:40:52,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:52,364 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-11 21:40:52,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825203454] [2024-11-11 21:40:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825203454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:52,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996591411] [2024-11-11 21:40:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:52,368 INFO L87 Difference]: Start difference. First operand 20486 states and 27286 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 21:40:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:52,473 INFO L93 Difference]: Finished difference Result 41514 states and 55328 transitions. [2024-11-11 21:40:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-11 21:40:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:52,515 INFO L225 Difference]: With dead ends: 41514 [2024-11-11 21:40:52,515 INFO L226 Difference]: Without dead ends: 21128 [2024-11-11 21:40:52,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:52,543 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:52,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 282 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21128 states. [2024-11-11 21:40:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21128 to 21126. [2024-11-11 21:40:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21126 states, 21125 states have (on average 1.3151242603550295) internal successors, (27782), 21125 states have internal predecessors, (27782), 0 states have call successors, (0), 0 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-11 21:40:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21126 states to 21126 states and 27782 transitions. [2024-11-11 21:40:52,915 INFO L78 Accepts]: Start accepts. Automaton has 21126 states and 27782 transitions. Word has length 100 [2024-11-11 21:40:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:52,916 INFO L471 AbstractCegarLoop]: Abstraction has 21126 states and 27782 transitions. [2024-11-11 21:40:52,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-11 21:40:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21126 states and 27782 transitions. [2024-11-11 21:40:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 21:40:52,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:52,927 INFO L218 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] [2024-11-11 21:40:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:40:52,928 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:40:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash 642240657, now seen corresponding path program 1 times [2024-11-11 21:40:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79348582] [2024-11-11 21:40:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79348582] [2024-11-11 21:40:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79348582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:40:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024553863] [2024-11-11 21:40:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:53,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:40:53,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:53,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:40:53,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:40:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:53,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:40:53,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:40:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:54,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:40:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024553863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:40:56,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:40:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-11 21:40:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515197023] [2024-11-11 21:40:56,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:40:56,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:40:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:40:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:40:56,606 INFO L87 Difference]: Start difference. First operand 21126 states and 27782 transitions. Second operand has 28 states, 28 states have (on average 10.75) internal successors, (301), 27 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-11 21:41:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:41:00,996 INFO L93 Difference]: Finished difference Result 198653 states and 260996 transitions. [2024-11-11 21:41:00,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-11 21:41:00,996 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.75) internal successors, (301), 27 states have internal predecessors, (301), 0 states have call successors, (0), 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 127 [2024-11-11 21:41:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:41:01,260 INFO L225 Difference]: With dead ends: 198653 [2024-11-11 21:41:01,260 INFO L226 Difference]: Without dead ends: 177627 [2024-11-11 21:41:01,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3035, Invalid=18135, Unknown=0, NotChecked=0, Total=21170 [2024-11-11 21:41:01,332 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 3656 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:41:01,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 2658 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:41:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177627 states. [2024-11-11 21:41:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177627 to 77927. [2024-11-11 21:41:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77927 states, 77926 states have (on average 1.3032749018299412) internal successors, (101559), 77926 states have internal predecessors, (101559), 0 states have call successors, (0), 0 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-11 21:41:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77927 states to 77927 states and 101559 transitions. [2024-11-11 21:41:03,192 INFO L78 Accepts]: Start accepts. Automaton has 77927 states and 101559 transitions. Word has length 127 [2024-11-11 21:41:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:41:03,193 INFO L471 AbstractCegarLoop]: Abstraction has 77927 states and 101559 transitions. [2024-11-11 21:41:03,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.75) internal successors, (301), 27 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-11 21:41:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 77927 states and 101559 transitions. [2024-11-11 21:41:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 21:41:03,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:41:03,203 INFO L218 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] [2024-11-11 21:41:03,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:41:03,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-11 21:41:03,405 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:41:03,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:41:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 340943369, now seen corresponding path program 1 times [2024-11-11 21:41:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:41:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768083902] [2024-11-11 21:41:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:41:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:41:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:41:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:41:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:41:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768083902] [2024-11-11 21:41:04,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768083902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:41:04,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480664642] [2024-11-11 21:41:04,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:41:04,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:41:04,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:41:04,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:41:04,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:41:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:41:04,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 21:41:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:41:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:41:05,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:41:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:41:05,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480664642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:41:05,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:41:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-11-11 21:41:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724428128] [2024-11-11 21:41:05,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:41:05,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 21:41:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:41:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 21:41:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2024-11-11 21:41:05,916 INFO L87 Difference]: Start difference. First operand 77927 states and 101559 transitions. Second operand has 27 states, 27 states have (on average 12.814814814814815) internal successors, (346), 27 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-11 21:41:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:41:14,262 INFO L93 Difference]: Finished difference Result 457314 states and 596947 transitions. [2024-11-11 21:41:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-11-11 21:41:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.814814814814815) internal successors, (346), 27 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) Word has length 128 [2024-11-11 21:41:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:41:15,162 INFO L225 Difference]: With dead ends: 457314 [2024-11-11 21:41:15,162 INFO L226 Difference]: Without dead ends: 379494 [2024-11-11 21:41:15,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6745 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3079, Invalid=17801, Unknown=0, NotChecked=0, Total=20880 [2024-11-11 21:41:15,310 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3518 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 3450 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3518 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:41:15,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3518 Valid, 2709 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3450 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 21:41:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379494 states. [2024-11-11 21:41:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379494 to 243366. [2024-11-11 21:41:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243366 states, 243365 states have (on average 1.3009430279621146) internal successors, (316604), 243365 states have internal predecessors, (316604), 0 states have call successors, (0), 0 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-11 21:41:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243366 states to 243366 states and 316604 transitions. [2024-11-11 21:41:19,858 INFO L78 Accepts]: Start accepts. Automaton has 243366 states and 316604 transitions. Word has length 128 [2024-11-11 21:41:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:41:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 243366 states and 316604 transitions. [2024-11-11 21:41:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.814814814814815) internal successors, (346), 27 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-11 21:41:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 243366 states and 316604 transitions. [2024-11-11 21:41:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 21:41:19,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:41:19,890 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:41:19,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:41:20,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-11 21:41:20,091 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-11 21:41:20,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:41:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1646171077, now seen corresponding path program 1 times [2024-11-11 21:41:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:41:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449773165] [2024-11-11 21:41:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:41:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:41:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:41:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:41:20,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:41:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449773165] [2024-11-11 21:41:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449773165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:41:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:41:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:41:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897501698] [2024-11-11 21:41:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:41:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:41:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:41:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:41:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:41:20,455 INFO L87 Difference]: Start difference. First operand 243366 states and 316604 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 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)