./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 e6586f3310e3029a2986640bb61549fc4f6b9393300761740fd8a157791ea846 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:59:01,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:59:01,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:59:01,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:59:01,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:59:01,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:59:01,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:59:01,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:59:01,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:59:01,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:59:01,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:59:01,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:59:01,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:59:01,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:59:01,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:59:01,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:59:01,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:59:01,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:59:01,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:59:01,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:59:01,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:59:01,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:59:01,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:59:01,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:59:01,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:59:01,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:59:01,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:59:01,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:59:01,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:59:01,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:59:01,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:59:01,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:59:01,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:59:01,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:59:01,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:59:01,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:59:01,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:59:01,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:59:01,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:59:01,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:59:01,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:59:01,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:59:01,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:59:01,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:59:01,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:59:01,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:59:01,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:59:01,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:59:01,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:59:01,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:59:01,869 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:59:01,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:59:01,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:59:01,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:59:01,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:59:01,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:59:01,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:59:01,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:59:01,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:59:01,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:59:01,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:01,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:59:01,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:59:01,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:59:01,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:59:01,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:59:01,874 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:59:01,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:59:01,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:59:01,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> e6586f3310e3029a2986640bb61549fc4f6b9393300761740fd8a157791ea846 [2022-11-02 20:59:02,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:59:02,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:59:02,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:59:02,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:59:02,157 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:59:02,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-11-02 20:59:02,261 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/data/666ff9474/012706e647e44dbab583650d10fd5d46/FLAG34a05e5d7 [2022-11-02 20:59:03,066 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:59:03,067 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-11-02 20:59:03,098 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/data/666ff9474/012706e647e44dbab583650d10fd5d46/FLAG34a05e5d7 [2022-11-02 20:59:03,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/data/666ff9474/012706e647e44dbab583650d10fd5d46 [2022-11-02 20:59:03,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:59:03,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:59:03,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:03,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:59:03,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:59:03,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551a36b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:03, skipping insertion in model container [2022-11-02 20:59:03,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:59:03" (1/1) ... [2022-11-02 20:59:03,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:59:03,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:59:03,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c[26897,26910] [2022-11-02 20:59:03,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c[33833,33846] [2022-11-02 20:59:04,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:04,914 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:59:04,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c[26897,26910] [2022-11-02 20:59:05,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c[33833,33846] [2022-11-02 20:59:05,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:59:05,634 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:59:05,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05 WrapperNode [2022-11-02 20:59:05,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:59:05,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:05,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:59:05,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:59:05,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:05,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,125 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5282 [2022-11-02 20:59:06,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:59:06,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:59:06,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:59:06,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:59:06,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,561 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:59:06,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:59:06,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:59:06,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:59:06,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (1/1) ... [2022-11-02 20:59:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:59:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:06,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:59:06,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6648b4-a9fe-48be-8563-3db599d8a265/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:59:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:59:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:59:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:59:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:59:07,119 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:59:07,121 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:59:12,642 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:59:12,668 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:59:12,668 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:59:12,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:12 BoogieIcfgContainer [2022-11-02 20:59:12,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:59:12,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:59:12,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:59:12,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:59:12,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:59:03" (1/3) ... [2022-11-02 20:59:12,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d00c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:12, skipping insertion in model container [2022-11-02 20:59:12,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:59:05" (2/3) ... [2022-11-02 20:59:12,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d00c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:59:12, skipping insertion in model container [2022-11-02 20:59:12,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:59:12" (3/3) ... [2022-11-02 20:59:12,686 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-11-02 20:59:12,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:59:12,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:59:12,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:59:12,801 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1e4ac634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:59:12,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:59:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:59:12,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:12,822 INFO L195 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] [2022-11-02 20:59:12,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2107180874, now seen corresponding path program 1 times [2022-11-02 20:59:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:12,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788415710] [2022-11-02 20:59:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:13,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788415710] [2022-11-02 20:59:13,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788415710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:13,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:13,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:59:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975712430] [2022-11-02 20:59:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:13,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:59:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:59:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:59:13,267 INFO L87 Difference]: Start difference. First operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 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 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:13,345 INFO L93 Difference]: Finished difference Result 1859 states and 3512 transitions. [2022-11-02 20:59:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:59:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-11-02 20:59:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:13,365 INFO L225 Difference]: With dead ends: 1859 [2022-11-02 20:59:13,365 INFO L226 Difference]: Without dead ends: 897 [2022-11-02 20:59:13,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:59:13,380 INFO L413 NwaCegarLoop]: 1755 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:13,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-11-02 20:59:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-11-02 20:59:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1688 transitions. [2022-11-02 20:59:13,497 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1688 transitions. Word has length 46 [2022-11-02 20:59:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:13,497 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1688 transitions. [2022-11-02 20:59:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-11-02 20:59:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:59:13,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:13,500 INFO L195 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] [2022-11-02 20:59:13,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:59:13,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-11-02 20:59:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:13,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306303066] [2022-11-02 20:59:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:13,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306303066] [2022-11-02 20:59:13,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306303066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:13,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:13,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987766794] [2022-11-02 20:59:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:59:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:59:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:59:13,890 INFO L87 Difference]: Start difference. First operand 897 states and 1688 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:14,098 INFO L93 Difference]: Finished difference Result 977 states and 1813 transitions. [2022-11-02 20:59:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:59:14,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-11-02 20:59:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:14,104 INFO L225 Difference]: With dead ends: 977 [2022-11-02 20:59:14,104 INFO L226 Difference]: Without dead ends: 897 [2022-11-02 20:59:14,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:59:14,107 INFO L413 NwaCegarLoop]: 1686 mSDtfsCounter, 3 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:14,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6680 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:59:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-11-02 20:59:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-11-02 20:59:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1627 transitions. [2022-11-02 20:59:14,139 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1627 transitions. Word has length 46 [2022-11-02 20:59:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:14,139 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1627 transitions. [2022-11-02 20:59:14,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-11-02 20:59:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:59:14,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:14,141 INFO L195 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] [2022-11-02 20:59:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:59:14,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 817411013, now seen corresponding path program 1 times [2022-11-02 20:59:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:14,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171772996] [2022-11-02 20:59:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:14,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171772996] [2022-11-02 20:59:14,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171772996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:14,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:14,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897424101] [2022-11-02 20:59:14,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:59:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:59:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:59:14,607 INFO L87 Difference]: Start difference. First operand 897 states and 1627 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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) [2022-11-02 20:59:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:23,950 INFO L93 Difference]: Finished difference Result 3152 states and 5936 transitions. [2022-11-02 20:59:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:59:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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 [2022-11-02 20:59:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:23,970 INFO L225 Difference]: With dead ends: 3152 [2022-11-02 20:59:23,970 INFO L226 Difference]: Without dead ends: 2399 [2022-11-02 20:59:23,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:59:23,977 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 2570 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:23,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 899 Invalid, 6404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1250 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-02 20:59:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2022-11-02 20:59:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2399. [2022-11-02 20:59:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3603 transitions. [2022-11-02 20:59:24,060 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3603 transitions. Word has length 60 [2022-11-02 20:59:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:24,061 INFO L495 AbstractCegarLoop]: Abstraction has 2399 states and 3603 transitions. [2022-11-02 20:59:24,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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) [2022-11-02 20:59:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3603 transitions. [2022-11-02 20:59:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:59:24,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:24,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:24,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:59:24,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-11-02 20:59:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644242677] [2022-11-02 20:59:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:24,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:24,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644242677] [2022-11-02 20:59:24,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644242677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:24,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:24,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:24,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240774720] [2022-11-02 20:59:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:24,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:24,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:24,306 INFO L87 Difference]: Start difference. First operand 2399 states and 3603 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:24,355 INFO L93 Difference]: Finished difference Result 2545 states and 3835 transitions. [2022-11-02 20:59:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-11-02 20:59:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:24,370 INFO L225 Difference]: With dead ends: 2545 [2022-11-02 20:59:24,373 INFO L226 Difference]: Without dead ends: 2469 [2022-11-02 20:59:24,374 INFO L412 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 [2022-11-02 20:59:24,388 INFO L413 NwaCegarLoop]: 1734 mSDtfsCounter, 1550 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:24,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 1853 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2022-11-02 20:59:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2022-11-02 20:59:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3712 transitions. [2022-11-02 20:59:24,466 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3712 transitions. Word has length 106 [2022-11-02 20:59:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:24,468 INFO L495 AbstractCegarLoop]: Abstraction has 2467 states and 3712 transitions. [2022-11-02 20:59:24,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3712 transitions. [2022-11-02 20:59:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:59:24,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:24,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:24,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:59:24,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 326222874, now seen corresponding path program 1 times [2022-11-02 20:59:24,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:24,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947846967] [2022-11-02 20:59:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:24,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947846967] [2022-11-02 20:59:24,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947846967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:24,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:24,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880076758] [2022-11-02 20:59:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:24,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:24,634 INFO L87 Difference]: Start difference. First operand 2467 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:24,692 INFO L93 Difference]: Finished difference Result 2743 states and 4152 transitions. [2022-11-02 20:59:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:24,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-11-02 20:59:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:24,706 INFO L225 Difference]: With dead ends: 2743 [2022-11-02 20:59:24,706 INFO L226 Difference]: Without dead ends: 2599 [2022-11-02 20:59:24,708 INFO L412 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 [2022-11-02 20:59:24,710 INFO L413 NwaCegarLoop]: 1729 mSDtfsCounter, 1546 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:24,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1852 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2022-11-02 20:59:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2597. [2022-11-02 20:59:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3919 transitions. [2022-11-02 20:59:24,801 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3919 transitions. Word has length 106 [2022-11-02 20:59:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:24,805 INFO L495 AbstractCegarLoop]: Abstraction has 2597 states and 3919 transitions. [2022-11-02 20:59:24,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3919 transitions. [2022-11-02 20:59:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:59:24,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:24,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:59:24,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1573731728, now seen corresponding path program 1 times [2022-11-02 20:59:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218519024] [2022-11-02 20:59:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:25,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218519024] [2022-11-02 20:59:25,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218519024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:25,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:25,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789349688] [2022-11-02 20:59:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:25,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:25,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:25,045 INFO L87 Difference]: Start difference. First operand 2597 states and 3919 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:25,140 INFO L93 Difference]: Finished difference Result 3121 states and 4753 transitions. [2022-11-02 20:59:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-11-02 20:59:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:25,157 INFO L225 Difference]: With dead ends: 3121 [2022-11-02 20:59:25,158 INFO L226 Difference]: Without dead ends: 2847 [2022-11-02 20:59:25,160 INFO L412 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 [2022-11-02 20:59:25,163 INFO L413 NwaCegarLoop]: 1724 mSDtfsCounter, 1542 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:25,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1851 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-11-02 20:59:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2845. [2022-11-02 20:59:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2843 states have (on average 1.516355962011959) internal successors, (4311), 2844 states have internal predecessors, (4311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4311 transitions. [2022-11-02 20:59:25,296 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4311 transitions. Word has length 106 [2022-11-02 20:59:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:25,297 INFO L495 AbstractCegarLoop]: Abstraction has 2845 states and 4311 transitions. [2022-11-02 20:59:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4311 transitions. [2022-11-02 20:59:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:59:25,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:25,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:59:25,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 832299526, now seen corresponding path program 1 times [2022-11-02 20:59:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:25,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017519559] [2022-11-02 20:59:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:25,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:25,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017519559] [2022-11-02 20:59:25,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017519559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:25,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:25,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199407523] [2022-11-02 20:59:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:25,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:25,468 INFO L87 Difference]: Start difference. First operand 2845 states and 4311 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:25,597 INFO L93 Difference]: Finished difference Result 3841 states and 5889 transitions. [2022-11-02 20:59:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-11-02 20:59:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:25,611 INFO L225 Difference]: With dead ends: 3841 [2022-11-02 20:59:25,611 INFO L226 Difference]: Without dead ends: 3319 [2022-11-02 20:59:25,615 INFO L412 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 [2022-11-02 20:59:25,617 INFO L413 NwaCegarLoop]: 1667 mSDtfsCounter, 1522 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:25,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1814 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-11-02 20:59:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3317. [2022-11-02 20:59:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3315 states have (on average 1.5236802413273) internal successors, (5051), 3316 states have internal predecessors, (5051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 5051 transitions. [2022-11-02 20:59:25,801 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 5051 transitions. Word has length 106 [2022-11-02 20:59:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:25,802 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 5051 transitions. [2022-11-02 20:59:25,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 5051 transitions. [2022-11-02 20:59:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:59:25,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:25,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:25,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:59:25,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2050284924, now seen corresponding path program 1 times [2022-11-02 20:59:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:25,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703004779] [2022-11-02 20:59:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:26,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:26,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703004779] [2022-11-02 20:59:26,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703004779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:26,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:26,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:59:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919614356] [2022-11-02 20:59:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:59:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:59:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:59:26,194 INFO L87 Difference]: Start difference. First operand 3317 states and 5051 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:28,151 INFO L93 Difference]: Finished difference Result 19221 states and 30155 transitions. [2022-11-02 20:59:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:59:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-11-02 20:59:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:28,235 INFO L225 Difference]: With dead ends: 19221 [2022-11-02 20:59:28,235 INFO L226 Difference]: Without dead ends: 18227 [2022-11-02 20:59:28,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:59:28,244 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 15549 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15549 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:28,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15549 Valid, 3647 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18227 states. [2022-11-02 20:59:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18227 to 4309. [2022-11-02 20:59:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4309 states, 4307 states have (on average 1.529370791734386) internal successors, (6587), 4308 states have internal predecessors, (6587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 6587 transitions. [2022-11-02 20:59:28,809 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 6587 transitions. Word has length 106 [2022-11-02 20:59:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:28,809 INFO L495 AbstractCegarLoop]: Abstraction has 4309 states and 6587 transitions. [2022-11-02 20:59:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 6587 transitions. [2022-11-02 20:59:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:28,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:28,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:28,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:59:28,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1813103660, now seen corresponding path program 1 times [2022-11-02 20:59:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:28,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086268950] [2022-11-02 20:59:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:28,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086268950] [2022-11-02 20:59:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086268950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:28,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:28,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353466798] [2022-11-02 20:59:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:28,956 INFO L87 Difference]: Start difference. First operand 4309 states and 6587 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:29,461 INFO L93 Difference]: Finished difference Result 7251 states and 11183 transitions. [2022-11-02 20:59:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:29,474 INFO L225 Difference]: With dead ends: 7251 [2022-11-02 20:59:29,474 INFO L226 Difference]: Without dead ends: 5265 [2022-11-02 20:59:29,478 INFO L412 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 [2022-11-02 20:59:29,481 INFO L413 NwaCegarLoop]: 1648 mSDtfsCounter, 1514 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1764 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 [2022-11-02 20:59:29,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1764 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2022-11-02 20:59:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5263. [2022-11-02 20:59:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 5261 states have (on average 1.5306975860102643) internal successors, (8053), 5262 states have internal predecessors, (8053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 8053 transitions. [2022-11-02 20:59:30,023 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 8053 transitions. Word has length 108 [2022-11-02 20:59:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:30,023 INFO L495 AbstractCegarLoop]: Abstraction has 5263 states and 8053 transitions. [2022-11-02 20:59:30,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 8053 transitions. [2022-11-02 20:59:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:30,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:30,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:30,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:59:30,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1879597172, now seen corresponding path program 1 times [2022-11-02 20:59:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:30,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110982408] [2022-11-02 20:59:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110982408] [2022-11-02 20:59:30,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110982408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:30,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:30,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:59:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443961524] [2022-11-02 20:59:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:59:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:59:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:59:30,762 INFO L87 Difference]: Start difference. First operand 5263 states and 8053 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:31,826 INFO L93 Difference]: Finished difference Result 8203 states and 12623 transitions. [2022-11-02 20:59:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:59:31,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:31,839 INFO L225 Difference]: With dead ends: 8203 [2022-11-02 20:59:31,839 INFO L226 Difference]: Without dead ends: 5265 [2022-11-02 20:59:31,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:59:31,846 INFO L413 NwaCegarLoop]: 1658 mSDtfsCounter, 9658 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9658 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:31,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9658 Valid, 2490 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2022-11-02 20:59:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5263. [2022-11-02 20:59:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 5261 states have (on average 1.5261357156434139) internal successors, (8029), 5262 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 8029 transitions. [2022-11-02 20:59:32,471 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 8029 transitions. Word has length 108 [2022-11-02 20:59:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:32,471 INFO L495 AbstractCegarLoop]: Abstraction has 5263 states and 8029 transitions. [2022-11-02 20:59:32,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 8029 transitions. [2022-11-02 20:59:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:32,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:32,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:32,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:59:32,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 621051568, now seen corresponding path program 1 times [2022-11-02 20:59:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:32,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053393418] [2022-11-02 20:59:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053393418] [2022-11-02 20:59:32,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053393418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:32,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:32,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5172670] [2022-11-02 20:59:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:32,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:32,676 INFO L87 Difference]: Start difference. First operand 5263 states and 8029 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:33,557 INFO L93 Difference]: Finished difference Result 10851 states and 16639 transitions. [2022-11-02 20:59:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:33,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:33,577 INFO L225 Difference]: With dead ends: 10851 [2022-11-02 20:59:33,578 INFO L226 Difference]: Without dead ends: 7913 [2022-11-02 20:59:33,584 INFO L412 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 [2022-11-02 20:59:33,585 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 1526 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:33,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1823 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2022-11-02 20:59:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7911. [2022-11-02 20:59:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7911 states, 7909 states have (on average 1.5229485396383866) internal successors, (12045), 7910 states have internal predecessors, (12045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 12045 transitions. [2022-11-02 20:59:34,446 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 12045 transitions. Word has length 108 [2022-11-02 20:59:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:34,447 INFO L495 AbstractCegarLoop]: Abstraction has 7911 states and 12045 transitions. [2022-11-02 20:59:34,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 12045 transitions. [2022-11-02 20:59:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:34,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:34,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:34,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:59:34,449 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash 894739280, now seen corresponding path program 1 times [2022-11-02 20:59:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:34,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582154731] [2022-11-02 20:59:34,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:34,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:34,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582154731] [2022-11-02 20:59:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582154731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:34,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:34,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120244092] [2022-11-02 20:59:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:34,559 INFO L87 Difference]: Start difference. First operand 7911 states and 12045 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:36,017 INFO L93 Difference]: Finished difference Result 18507 states and 28207 transitions. [2022-11-02 20:59:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:36,047 INFO L225 Difference]: With dead ends: 18507 [2022-11-02 20:59:36,047 INFO L226 Difference]: Without dead ends: 12921 [2022-11-02 20:59:36,058 INFO L412 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 [2022-11-02 20:59:36,059 INFO L413 NwaCegarLoop]: 1693 mSDtfsCounter, 1530 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:36,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1832 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12921 states. [2022-11-02 20:59:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12921 to 12919. [2022-11-02 20:59:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12919 states, 12917 states have (on average 1.5134319114345436) internal successors, (19549), 12918 states have internal predecessors, (19549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12919 states to 12919 states and 19549 transitions. [2022-11-02 20:59:37,590 INFO L78 Accepts]: Start accepts. Automaton has 12919 states and 19549 transitions. Word has length 108 [2022-11-02 20:59:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:37,591 INFO L495 AbstractCegarLoop]: Abstraction has 12919 states and 19549 transitions. [2022-11-02 20:59:37,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 12919 states and 19549 transitions. [2022-11-02 20:59:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:37,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:37,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:37,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:59:37,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1581156368, now seen corresponding path program 1 times [2022-11-02 20:59:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:37,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400178498] [2022-11-02 20:59:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:37,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400178498] [2022-11-02 20:59:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400178498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:37,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:37,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261853986] [2022-11-02 20:59:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:37,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:37,723 INFO L87 Difference]: Start difference. First operand 12919 states and 19549 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:40,398 INFO L93 Difference]: Finished difference Result 32955 states and 49759 transitions. [2022-11-02 20:59:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:40,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:40,451 INFO L225 Difference]: With dead ends: 32955 [2022-11-02 20:59:40,451 INFO L226 Difference]: Without dead ends: 22361 [2022-11-02 20:59:40,464 INFO L412 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 [2022-11-02 20:59:40,465 INFO L413 NwaCegarLoop]: 1706 mSDtfsCounter, 1534 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:40,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1841 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22361 states. [2022-11-02 20:59:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22361 to 22359. [2022-11-02 20:59:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22359 states, 22357 states have (on average 1.4984568591492597) internal successors, (33501), 22358 states have internal predecessors, (33501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22359 states to 22359 states and 33501 transitions. [2022-11-02 20:59:43,188 INFO L78 Accepts]: Start accepts. Automaton has 22359 states and 33501 transitions. Word has length 108 [2022-11-02 20:59:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:43,188 INFO L495 AbstractCegarLoop]: Abstraction has 22359 states and 33501 transitions. [2022-11-02 20:59:43,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22359 states and 33501 transitions. [2022-11-02 20:59:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:59:43,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:43,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:43,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:59:43,191 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1401750384, now seen corresponding path program 1 times [2022-11-02 20:59:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:43,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464632397] [2022-11-02 20:59:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:43,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464632397] [2022-11-02 20:59:43,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464632397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:43,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:43,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:59:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053194950] [2022-11-02 20:59:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:59:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:59:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:59:43,294 INFO L87 Difference]: Start difference. First operand 22359 states and 33501 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:48,075 INFO L93 Difference]: Finished difference Result 60123 states and 89695 transitions. [2022-11-02 20:59:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:59:48,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-11-02 20:59:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:48,157 INFO L225 Difference]: With dead ends: 60123 [2022-11-02 20:59:48,157 INFO L226 Difference]: Without dead ends: 40089 [2022-11-02 20:59:48,184 INFO L412 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 [2022-11-02 20:59:48,185 INFO L413 NwaCegarLoop]: 1719 mSDtfsCounter, 1538 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:48,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 1850 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:59:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40089 states. [2022-11-02 20:59:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40089 to 40087. [2022-11-02 20:59:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40087 states, 40085 states have (on average 1.4791817388050392) internal successors, (59293), 40086 states have internal predecessors, (59293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40087 states to 40087 states and 59293 transitions. [2022-11-02 20:59:53,716 INFO L78 Accepts]: Start accepts. Automaton has 40087 states and 59293 transitions. Word has length 108 [2022-11-02 20:59:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:53,717 INFO L495 AbstractCegarLoop]: Abstraction has 40087 states and 59293 transitions. [2022-11-02 20:59:53,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40087 states and 59293 transitions. [2022-11-02 20:59:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:59:53,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:53,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:53,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:59:53,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:59:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2018214719, now seen corresponding path program 1 times [2022-11-02 20:59:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:53,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364065925] [2022-11-02 20:59:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364065925] [2022-11-02 20:59:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364065925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:54,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:59:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656515031] [2022-11-02 20:59:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:59:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:59:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:59:54,086 INFO L87 Difference]: Start difference. First operand 40087 states and 59293 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:03,908 INFO L93 Difference]: Finished difference Result 72254 states and 105870 transitions. [2022-11-02 21:00:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-11-02 21:00:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:04,041 INFO L225 Difference]: With dead ends: 72254 [2022-11-02 21:00:04,041 INFO L226 Difference]: Without dead ends: 72252 [2022-11-02 21:00:04,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:00:04,058 INFO L413 NwaCegarLoop]: 1669 mSDtfsCounter, 334 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:04,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 6543 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:00:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72252 states. [2022-11-02 21:00:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72252 to 41623. [2022-11-02 21:00:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41623 states, 41621 states have (on average 1.4584224309843588) internal successors, (60701), 41622 states have internal predecessors, (60701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41623 states to 41623 states and 60701 transitions. [2022-11-02 21:00:10,301 INFO L78 Accepts]: Start accepts. Automaton has 41623 states and 60701 transitions. Word has length 109 [2022-11-02 21:00:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:10,301 INFO L495 AbstractCegarLoop]: Abstraction has 41623 states and 60701 transitions. [2022-11-02 21:00:10,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41623 states and 60701 transitions. [2022-11-02 21:00:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-02 21:00:10,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:10,305 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:00:10,305 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 6638733, now seen corresponding path program 1 times [2022-11-02 21:00:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478270747] [2022-11-02 21:00:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:10,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478270747] [2022-11-02 21:00:10,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478270747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:10,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:10,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:00:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542448684] [2022-11-02 21:00:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:10,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:10,672 INFO L87 Difference]: Start difference. First operand 41623 states and 60701 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:20,973 INFO L93 Difference]: Finished difference Result 45417 states and 66806 transitions. [2022-11-02 21:00:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2022-11-02 21:00:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:21,021 INFO L225 Difference]: With dead ends: 45417 [2022-11-02 21:00:21,021 INFO L226 Difference]: Without dead ends: 43125 [2022-11-02 21:00:21,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:21,033 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 892 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:21,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1083 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 21:00:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43125 states. [2022-11-02 21:00:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43125 to 43125. [2022-11-02 21:00:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43125 states, 43123 states have (on average 1.4443800292187463) internal successors, (62286), 43124 states have internal predecessors, (62286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43125 states to 43125 states and 62286 transitions. [2022-11-02 21:00:26,097 INFO L78 Accepts]: Start accepts. Automaton has 43125 states and 62286 transitions. Word has length 131 [2022-11-02 21:00:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:26,097 INFO L495 AbstractCegarLoop]: Abstraction has 43125 states and 62286 transitions. [2022-11-02 21:00:26,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 43125 states and 62286 transitions. [2022-11-02 21:00:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-02 21:00:26,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:26,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:00:26,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1243757929, now seen corresponding path program 1 times [2022-11-02 21:00:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66911189] [2022-11-02 21:00:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 21:00:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66911189] [2022-11-02 21:00:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66911189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:26,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:26,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:00:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084835436] [2022-11-02 21:00:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:26,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:00:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:00:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:26,474 INFO L87 Difference]: Start difference. First operand 43125 states and 62286 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)