./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/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_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/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_1869bf8f-2bde-4e7d-b976-87388c089686/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 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 --- 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 21:01:28,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:01:28,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:01:28,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:01:28,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:01:28,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:01:28,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:01:28,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:01:28,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:01:28,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:01:28,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:01:28,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:01:28,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:01:28,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:01:28,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:01:28,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:01:28,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:01:28,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:01:28,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:01:28,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:01:28,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:01:28,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:01:28,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:01:28,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:01:28,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:01:28,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:01:28,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:01:28,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:01:28,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:01:28,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:01:28,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:01:28,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:01:28,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:01:28,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:01:28,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:01:28,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:01:28,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:01:28,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:01:28,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:01:28,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:01:28,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:01:28,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:01:29,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:01:29,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:01:29,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:01:29,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:01:29,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:01:29,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:01:29,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:01:29,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:01:29,044 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:01:29,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:01:29,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:01:29,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:01:29,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:01:29,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:01:29,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:01:29,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:01:29,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:01:29,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:01:29,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:01:29,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:01:29,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:01:29,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:01:29,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:01:29,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:01:29,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:29,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:01:29,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:01:29,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:01:29,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:01:29,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:01:29,051 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:01:29,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:01:29,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:01:29,051 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_1869bf8f-2bde-4e7d-b976-87388c089686/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_1869bf8f-2bde-4e7d-b976-87388c089686/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 -> 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 [2022-11-02 21:01:29,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:01:29,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:01:29,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:01:29,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:01:29,347 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:01:29,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 21:01:29,410 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/data/4e0e0231b/e5ed426a374c4a23937fe58cb4bebcfa/FLAG700291a54 [2022-11-02 21:01:30,115 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:01:30,116 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 21:01:30,128 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/data/4e0e0231b/e5ed426a374c4a23937fe58cb4bebcfa/FLAG700291a54 [2022-11-02 21:01:30,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/data/4e0e0231b/e5ed426a374c4a23937fe58cb4bebcfa [2022-11-02 21:01:30,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:01:30,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:01:30,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:30,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:01:30,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:01:30,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cb75a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30, skipping insertion in model container [2022-11-02 21:01:30,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:01:30,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:01:30,733 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_1869bf8f-2bde-4e7d-b976-87388c089686/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-11-02 21:01:30,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:30,835 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:01:30,920 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_1869bf8f-2bde-4e7d-b976-87388c089686/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-11-02 21:01:30,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:31,007 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:01:31,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31 WrapperNode [2022-11-02 21:01:31,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:31,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:31,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:01:31,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:01:31,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,076 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 574 [2022-11-02 21:01:31,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:31,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:01:31,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:01:31,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:01:31,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:01:31,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:01:31,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:01:31,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:01:31,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (1/1) ... [2022-11-02 21:01:31,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:31,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:31,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:01:31,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:01:31,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:01:31,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:01:31,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:01:31,448 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:01:31,450 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:01:32,120 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:01:32,130 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:01:32,130 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:01:32,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:32 BoogieIcfgContainer [2022-11-02 21:01:32,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:01:32,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:01:32,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:01:32,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:01:32,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:01:30" (1/3) ... [2022-11-02 21:01:32,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4ed66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:32, skipping insertion in model container [2022-11-02 21:01:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:31" (2/3) ... [2022-11-02 21:01:32,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4ed66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:32, skipping insertion in model container [2022-11-02 21:01:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:32" (3/3) ... [2022-11-02 21:01:32,150 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-11-02 21:01:32,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:01:32,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:01:32,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:01:32,282 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;@7f331f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:01:32,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:01:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 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:01:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:01:32,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:32,299 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] [2022-11-02 21:01:32,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:32,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1935961454, now seen corresponding path program 1 times [2022-11-02 21:01:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:32,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104164281] [2022-11-02 21:01:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:32,921 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 21:01:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104164281] [2022-11-02 21:01:32,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104164281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:32,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:32,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491031666] [2022-11-02 21:01:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:32,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:32,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:33,008 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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:01:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,326 INFO L93 Difference]: Finished difference Result 468 states and 757 transitions. [2022-11-02 21:01:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-11-02 21:01:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,353 INFO L225 Difference]: With dead ends: 468 [2022-11-02 21:01:33,354 INFO L226 Difference]: Without dead ends: 394 [2022-11-02 21:01:33,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:33,364 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 829 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 867 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-02 21:01:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 232. [2022-11-02 21:01:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 344 transitions. [2022-11-02 21:01:33,459 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 344 transitions. Word has length 49 [2022-11-02 21:01:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,460 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 344 transitions. [2022-11-02 21:01:33,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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:01:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 344 transitions. [2022-11-02 21:01:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:01:33,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,462 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] [2022-11-02 21:01:33,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:01:33,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1118200662, now seen corresponding path program 1 times [2022-11-02 21:01:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355640350] [2022-11-02 21:01:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:33,566 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 21:01:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:33,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355640350] [2022-11-02 21:01:33,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355640350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:33,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:33,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:33,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402189237] [2022-11-02 21:01:33,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:33,571 INFO L87 Difference]: Start difference. First operand 232 states and 344 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,636 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2022-11-02 21:01:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-02 21:01:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,639 INFO L225 Difference]: With dead ends: 570 [2022-11-02 21:01:33,639 INFO L226 Difference]: Without dead ends: 402 [2022-11-02 21:01:33,641 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 21:01:33,642 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 141 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-02 21:01:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-11-02 21:01:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 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:01:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 595 transitions. [2022-11-02 21:01:33,691 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 595 transitions. Word has length 52 [2022-11-02 21:01:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,692 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 595 transitions. [2022-11-02 21:01:33,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 595 transitions. [2022-11-02 21:01:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:01:33,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,694 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] [2022-11-02 21:01:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:01:33,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1570903849, now seen corresponding path program 1 times [2022-11-02 21:01:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180739581] [2022-11-02 21:01:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:33,795 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 21:01:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180739581] [2022-11-02 21:01:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180739581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:33,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:33,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559669731] [2022-11-02 21:01:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:33,799 INFO L87 Difference]: Start difference. First operand 400 states and 595 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,890 INFO L93 Difference]: Finished difference Result 980 states and 1475 transitions. [2022-11-02 21:01:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-02 21:01:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,894 INFO L225 Difference]: With dead ends: 980 [2022-11-02 21:01:33,894 INFO L226 Difference]: Without dead ends: 692 [2022-11-02 21:01:33,896 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 21:01:33,897 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-02 21:01:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2022-11-02 21:01:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 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:01:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1019 transitions. [2022-11-02 21:01:33,975 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1019 transitions. Word has length 52 [2022-11-02 21:01:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,978 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1019 transitions. [2022-11-02 21:01:33,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1019 transitions. [2022-11-02 21:01:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:01:33,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,989 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] [2022-11-02 21:01:33,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:01:33,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1320706551, now seen corresponding path program 1 times [2022-11-02 21:01:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079505669] [2022-11-02 21:01:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,123 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 21:01:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:34,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079505669] [2022-11-02 21:01:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079505669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:34,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926614576] [2022-11-02 21:01:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:34,126 INFO L87 Difference]: Start difference. First operand 690 states and 1019 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:34,323 INFO L93 Difference]: Finished difference Result 1813 states and 2684 transitions. [2022-11-02 21:01:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-02 21:01:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:34,330 INFO L225 Difference]: With dead ends: 1813 [2022-11-02 21:01:34,330 INFO L226 Difference]: Without dead ends: 1211 [2022-11-02 21:01:34,333 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 21:01:34,345 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:34,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2022-11-02 21:01:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2022-11-02 21:01:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 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:01:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1740 transitions. [2022-11-02 21:01:34,494 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1740 transitions. Word has length 52 [2022-11-02 21:01:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:34,495 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1740 transitions. [2022-11-02 21:01:34,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:01:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1740 transitions. [2022-11-02 21:01:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 21:01:34,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:34,496 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] [2022-11-02 21:01:34,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:01:34,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1834372633, now seen corresponding path program 1 times [2022-11-02 21:01:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482169671] [2022-11-02 21:01:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,624 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 21:01:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:34,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482169671] [2022-11-02 21:01:34,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482169671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:34,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:34,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313459651] [2022-11-02 21:01:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:34,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:34,630 INFO L87 Difference]: Start difference. First operand 1209 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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:01:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:34,922 INFO L93 Difference]: Finished difference Result 2352 states and 3451 transitions. [2022-11-02 21:01:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-11-02 21:01:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:34,931 INFO L225 Difference]: With dead ends: 2352 [2022-11-02 21:01:34,932 INFO L226 Difference]: Without dead ends: 2006 [2022-11-02 21:01:34,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:34,938 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 557 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:34,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 884 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2022-11-02 21:01:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1614. [2022-11-02 21:01:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 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:01:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2335 transitions. [2022-11-02 21:01:35,163 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2335 transitions. Word has length 53 [2022-11-02 21:01:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:35,164 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2335 transitions. [2022-11-02 21:01:35,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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:01:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2335 transitions. [2022-11-02 21:01:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 21:01:35,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:35,170 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] [2022-11-02 21:01:35,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:01:35,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1785989049, now seen corresponding path program 1 times [2022-11-02 21:01:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990580509] [2022-11-02 21:01:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,355 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 21:01:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:35,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990580509] [2022-11-02 21:01:35,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990580509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:35,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:35,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920633438] [2022-11-02 21:01:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:35,357 INFO L87 Difference]: Start difference. First operand 1614 states and 2335 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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:01:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:35,691 INFO L93 Difference]: Finished difference Result 2726 states and 4001 transitions. [2022-11-02 21:01:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:35,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-11-02 21:01:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:35,701 INFO L225 Difference]: With dead ends: 2726 [2022-11-02 21:01:35,701 INFO L226 Difference]: Without dead ends: 2380 [2022-11-02 21:01:35,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:35,704 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 563 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:35,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 859 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-11-02 21:01:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1925. [2022-11-02 21:01:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 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:01:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2795 transitions. [2022-11-02 21:01:35,928 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2795 transitions. Word has length 53 [2022-11-02 21:01:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:35,929 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 2795 transitions. [2022-11-02 21:01:35,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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:01:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2795 transitions. [2022-11-02 21:01:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 21:01:35,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:35,931 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] [2022-11-02 21:01:35,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:01:35,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1176645599, now seen corresponding path program 1 times [2022-11-02 21:01:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:35,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99046854] [2022-11-02 21:01:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,065 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 21:01:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99046854] [2022-11-02 21:01:36,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99046854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:36,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:36,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035540772] [2022-11-02 21:01:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:36,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:36,068 INFO L87 Difference]: Start difference. First operand 1925 states and 2795 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:01:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:36,415 INFO L93 Difference]: Finished difference Result 3143 states and 4614 transitions. [2022-11-02 21:01:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:36,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-11-02 21:01:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:36,425 INFO L225 Difference]: With dead ends: 3143 [2022-11-02 21:01:36,425 INFO L226 Difference]: Without dead ends: 2797 [2022-11-02 21:01:36,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:36,428 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 568 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:36,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-11-02 21:01:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2223. [2022-11-02 21:01:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 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:01:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3238 transitions. [2022-11-02 21:01:36,665 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3238 transitions. Word has length 54 [2022-11-02 21:01:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:36,665 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3238 transitions. [2022-11-02 21:01:36,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:01:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3238 transitions. [2022-11-02 21:01:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 21:01:36,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:36,667 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] [2022-11-02 21:01:36,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:01:36,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1625242146, now seen corresponding path program 1 times [2022-11-02 21:01:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:36,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529497841] [2022-11-02 21:01:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,804 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 21:01:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:36,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529497841] [2022-11-02 21:01:36,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529497841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:36,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:36,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513161478] [2022-11-02 21:01:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:36,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:36,807 INFO L87 Difference]: Start difference. First operand 2223 states and 3238 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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:01:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:37,441 INFO L93 Difference]: Finished difference Result 5276 states and 7686 transitions. [2022-11-02 21:01:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-11-02 21:01:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:37,454 INFO L225 Difference]: With dead ends: 5276 [2022-11-02 21:01:37,454 INFO L226 Difference]: Without dead ends: 3095 [2022-11-02 21:01:37,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:37,460 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 795 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:37,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 207 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-11-02 21:01:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3077. [2022-11-02 21:01:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 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:01:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4444 transitions. [2022-11-02 21:01:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4444 transitions. Word has length 57 [2022-11-02 21:01:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:37,860 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 4444 transitions. [2022-11-02 21:01:37,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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:01:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4444 transitions. [2022-11-02 21:01:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 21:01:37,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:37,863 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] [2022-11-02 21:01:37,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:01:37,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1198136650, now seen corresponding path program 1 times [2022-11-02 21:01:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:37,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001574395] [2022-11-02 21:01:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,961 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 21:01:37,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001574395] [2022-11-02 21:01:37,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001574395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:37,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:37,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282885307] [2022-11-02 21:01:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:37,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:37,964 INFO L87 Difference]: Start difference. First operand 3077 states and 4444 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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:01:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:38,773 INFO L93 Difference]: Finished difference Result 7194 states and 10361 transitions. [2022-11-02 21:01:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:38,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-02 21:01:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:38,790 INFO L225 Difference]: With dead ends: 7194 [2022-11-02 21:01:38,790 INFO L226 Difference]: Without dead ends: 4204 [2022-11-02 21:01:38,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:38,798 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 792 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:38,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 197 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2022-11-02 21:01:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3077. [2022-11-02 21:01:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 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:01:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4394 transitions. [2022-11-02 21:01:39,323 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4394 transitions. Word has length 58 [2022-11-02 21:01:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:39,324 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 4394 transitions. [2022-11-02 21:01:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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:01:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4394 transitions. [2022-11-02 21:01:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 21:01:39,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:39,327 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] [2022-11-02 21:01:39,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:01:39,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash -153913959, now seen corresponding path program 1 times [2022-11-02 21:01:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:39,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291453439] [2022-11-02 21:01:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,435 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 21:01:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:39,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291453439] [2022-11-02 21:01:39,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291453439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:39,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:39,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355107868] [2022-11-02 21:01:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:39,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:39,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:39,438 INFO L87 Difference]: Start difference. First operand 3077 states and 4394 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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:01:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:40,235 INFO L93 Difference]: Finished difference Result 7259 states and 10357 transitions. [2022-11-02 21:01:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-02 21:01:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:40,252 INFO L225 Difference]: With dead ends: 7259 [2022-11-02 21:01:40,253 INFO L226 Difference]: Without dead ends: 4260 [2022-11-02 21:01:40,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:40,258 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 737 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:40,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 209 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2022-11-02 21:01:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4235. [2022-11-02 21:01:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 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:01:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5979 transitions. [2022-11-02 21:01:40,873 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5979 transitions. Word has length 58 [2022-11-02 21:01:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:40,874 INFO L495 AbstractCegarLoop]: Abstraction has 4235 states and 5979 transitions. [2022-11-02 21:01:40,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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:01:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5979 transitions. [2022-11-02 21:01:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:01:40,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:40,880 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] [2022-11-02 21:01:40,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:01:40,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1572096567, now seen corresponding path program 1 times [2022-11-02 21:01:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:40,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951741778] [2022-11-02 21:01:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,047 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 21:01:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951741778] [2022-11-02 21:01:41,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951741778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:41,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:41,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686641687] [2022-11-02 21:01:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:41,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:41,050 INFO L87 Difference]: Start difference. First operand 4235 states and 5979 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:43,710 INFO L93 Difference]: Finished difference Result 18150 states and 25629 transitions. [2022-11-02 21:01:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:01:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-02 21:01:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:43,763 INFO L225 Difference]: With dead ends: 18150 [2022-11-02 21:01:43,763 INFO L226 Difference]: Without dead ends: 16780 [2022-11-02 21:01:43,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:01:43,770 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 2503 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2503 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:43,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2503 Valid, 388 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16780 states. [2022-11-02 21:01:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16780 to 4247. [2022-11-02 21:01:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4246 states have (on average 1.4119170984455958) internal successors, (5995), 4246 states have internal predecessors, (5995), 0 states have call successors, (0), 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:01:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 5995 transitions. [2022-11-02 21:01:44,738 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 5995 transitions. Word has length 59 [2022-11-02 21:01:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:44,738 INFO L495 AbstractCegarLoop]: Abstraction has 4247 states and 5995 transitions. [2022-11-02 21:01:44,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 5995 transitions. [2022-11-02 21:01:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 21:01:44,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:44,742 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 21:01:44,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:01:44,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1131093665, now seen corresponding path program 1 times [2022-11-02 21:01:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035626109] [2022-11-02 21:01:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,882 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 21:01:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:44,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035626109] [2022-11-02 21:01:44,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035626109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:44,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247753003] [2022-11-02 21:01:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:44,885 INFO L87 Difference]: Start difference. First operand 4247 states and 5995 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:48,140 INFO L93 Difference]: Finished difference Result 16333 states and 22941 transitions. [2022-11-02 21:01:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:01:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:48,183 INFO L225 Difference]: With dead ends: 16333 [2022-11-02 21:01:48,184 INFO L226 Difference]: Without dead ends: 14103 [2022-11-02 21:01:48,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:01:48,190 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 1847 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:48,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 328 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14103 states. [2022-11-02 21:01:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14103 to 4267. [2022-11-02 21:01:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 4266 states have (on average 1.4109235818096577) internal successors, (6019), 4266 states have internal predecessors, (6019), 0 states have call successors, (0), 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:01:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6019 transitions. [2022-11-02 21:01:49,090 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6019 transitions. Word has length 60 [2022-11-02 21:01:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:49,090 INFO L495 AbstractCegarLoop]: Abstraction has 4267 states and 6019 transitions. [2022-11-02 21:01:49,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6019 transitions. [2022-11-02 21:01:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 21:01:49,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:49,093 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 21:01:49,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:01:49,093 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1840434496, now seen corresponding path program 1 times [2022-11-02 21:01:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:49,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563178030] [2022-11-02 21:01:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,215 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 21:01:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:49,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563178030] [2022-11-02 21:01:49,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563178030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:49,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:49,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903865406] [2022-11-02 21:01:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:49,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:49,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:49,218 INFO L87 Difference]: Start difference. First operand 4267 states and 6019 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:53,666 INFO L93 Difference]: Finished difference Result 19141 states and 27003 transitions. [2022-11-02 21:01:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:01:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:53,714 INFO L225 Difference]: With dead ends: 19141 [2022-11-02 21:01:53,715 INFO L226 Difference]: Without dead ends: 17095 [2022-11-02 21:01:53,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:01:53,722 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2087 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2087 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:53,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2087 Valid, 367 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17095 states. [2022-11-02 21:01:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17095 to 4345. [2022-11-02 21:01:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 1.408609576427256) internal successors, (6119), 4344 states have internal predecessors, (6119), 0 states have call successors, (0), 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:01:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 6119 transitions. [2022-11-02 21:01:54,677 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 6119 transitions. Word has length 60 [2022-11-02 21:01:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:54,677 INFO L495 AbstractCegarLoop]: Abstraction has 4345 states and 6119 transitions. [2022-11-02 21:01:54,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 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 21:01:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6119 transitions. [2022-11-02 21:01:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:01:54,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:54,681 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] [2022-11-02 21:01:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:01:54,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:01:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1556118219, now seen corresponding path program 1 times [2022-11-02 21:01:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:54,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294815388] [2022-11-02 21:01:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,077 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 21:01:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:55,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294815388] [2022-11-02 21:01:55,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294815388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:55,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:55,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522796135] [2022-11-02 21:01:55,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:55,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:01:55,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:55,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:01:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:55,080 INFO L87 Difference]: Start difference. First operand 4345 states and 6119 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:59,584 INFO L93 Difference]: Finished difference Result 14830 states and 20853 transitions. [2022-11-02 21:01:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:01:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:01:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:59,604 INFO L225 Difference]: With dead ends: 14830 [2022-11-02 21:01:59,605 INFO L226 Difference]: Without dead ends: 11241 [2022-11-02 21:01:59,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:01:59,611 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 2033 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:59,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 1099 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:01:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2022-11-02 21:02:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 4345. [2022-11-02 21:02:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 1.4072283609576428) internal successors, (6113), 4344 states have internal predecessors, (6113), 0 states have call successors, (0), 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:02:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 6113 transitions. [2022-11-02 21:02:00,658 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 6113 transitions. Word has length 62 [2022-11-02 21:02:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:00,658 INFO L495 AbstractCegarLoop]: Abstraction has 4345 states and 6113 transitions. [2022-11-02 21:02:00,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6113 transitions. [2022-11-02 21:02:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:02:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:00,661 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] [2022-11-02 21:02:00,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:02:00,661 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -443125389, now seen corresponding path program 1 times [2022-11-02 21:02:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576154432] [2022-11-02 21:02:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:01,013 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 21:02:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576154432] [2022-11-02 21:02:01,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576154432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:01,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:01,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:02:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005037385] [2022-11-02 21:02:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:01,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:01,015 INFO L87 Difference]: Start difference. First operand 4345 states and 6113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:05,461 INFO L93 Difference]: Finished difference Result 14363 states and 20243 transitions. [2022-11-02 21:02:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:02:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:02:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:05,487 INFO L225 Difference]: With dead ends: 14363 [2022-11-02 21:02:05,488 INFO L226 Difference]: Without dead ends: 10913 [2022-11-02 21:02:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2022-11-02 21:02:05,497 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 2120 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:05,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 1078 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:02:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2022-11-02 21:02:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 4261. [2022-11-02 21:02:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4260 states have (on average 1.4046948356807512) internal successors, (5984), 4260 states have internal predecessors, (5984), 0 states have call successors, (0), 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:02:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5984 transitions. [2022-11-02 21:02:06,933 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5984 transitions. Word has length 62 [2022-11-02 21:02:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:06,933 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 5984 transitions. [2022-11-02 21:02:06,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5984 transitions. [2022-11-02 21:02:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:02:06,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:06,939 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] [2022-11-02 21:02:06,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:02:06,940 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1162737396, now seen corresponding path program 1 times [2022-11-02 21:02:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:06,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798085008] [2022-11-02 21:02:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:07,394 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 21:02:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798085008] [2022-11-02 21:02:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798085008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:07,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:07,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:02:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629326543] [2022-11-02 21:02:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:07,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:07,396 INFO L87 Difference]: Start difference. First operand 4261 states and 5984 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:12,058 INFO L93 Difference]: Finished difference Result 14903 states and 20963 transitions. [2022-11-02 21:02:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:02:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:02:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:12,078 INFO L225 Difference]: With dead ends: 14903 [2022-11-02 21:02:12,078 INFO L226 Difference]: Without dead ends: 11324 [2022-11-02 21:02:12,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:02:12,085 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 1549 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:12,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1554 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:02:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2022-11-02 21:02:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 4082. [2022-11-02 21:02:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 1.4021073266356285) internal successors, (5722), 4081 states have internal predecessors, (5722), 0 states have call successors, (0), 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:02:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5722 transitions. [2022-11-02 21:02:13,615 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5722 transitions. Word has length 62 [2022-11-02 21:02:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:13,615 INFO L495 AbstractCegarLoop]: Abstraction has 4082 states and 5722 transitions. [2022-11-02 21:02:13,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5722 transitions. [2022-11-02 21:02:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:02:13,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:13,619 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] [2022-11-02 21:02:13,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:02:13,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1143949417, now seen corresponding path program 1 times [2022-11-02 21:02:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:13,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137054893] [2022-11-02 21:02:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:13,689 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 21:02:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137054893] [2022-11-02 21:02:13,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137054893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:13,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:13,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622369065] [2022-11-02 21:02:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:13,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:13,692 INFO L87 Difference]: Start difference. First operand 4082 states and 5722 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:14,940 INFO L93 Difference]: Finished difference Result 6091 states and 8563 transitions. [2022-11-02 21:02:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:14,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-02 21:02:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:14,946 INFO L225 Difference]: With dead ends: 6091 [2022-11-02 21:02:14,947 INFO L226 Difference]: Without dead ends: 3975 [2022-11-02 21:02:14,950 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 21:02:14,951 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 130 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:14,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 473 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2022-11-02 21:02:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3973. [2022-11-02 21:02:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3972 states have (on average 1.3862034239677745) internal successors, (5506), 3972 states have internal predecessors, (5506), 0 states have call successors, (0), 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:02:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5506 transitions. [2022-11-02 21:02:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5506 transitions. Word has length 63 [2022-11-02 21:02:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:16,070 INFO L495 AbstractCegarLoop]: Abstraction has 3973 states and 5506 transitions. [2022-11-02 21:02:16,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5506 transitions. [2022-11-02 21:02:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:02:16,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:16,073 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] [2022-11-02 21:02:16,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:02:16,074 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1363691260, now seen corresponding path program 1 times [2022-11-02 21:02:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:16,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118181267] [2022-11-02 21:02:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:16,131 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 21:02:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118181267] [2022-11-02 21:02:16,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118181267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:16,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:16,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150025096] [2022-11-02 21:02:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:16,134 INFO L87 Difference]: Start difference. First operand 3973 states and 5506 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:17,196 INFO L93 Difference]: Finished difference Result 5478 states and 7588 transitions. [2022-11-02 21:02:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-02 21:02:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:17,201 INFO L225 Difference]: With dead ends: 5478 [2022-11-02 21:02:17,201 INFO L226 Difference]: Without dead ends: 3380 [2022-11-02 21:02:17,204 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 21:02:17,204 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 118 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:17,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 462 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2022-11-02 21:02:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3378. [2022-11-02 21:02:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.3591945513769619) internal successors, (4590), 3377 states have internal predecessors, (4590), 0 states have call successors, (0), 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:02:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4590 transitions. [2022-11-02 21:02:18,278 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4590 transitions. Word has length 63 [2022-11-02 21:02:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:18,279 INFO L495 AbstractCegarLoop]: Abstraction has 3378 states and 4590 transitions. [2022-11-02 21:02:18,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4590 transitions. [2022-11-02 21:02:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:02:18,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:18,282 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] [2022-11-02 21:02:18,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:02:18,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1254313906, now seen corresponding path program 1 times [2022-11-02 21:02:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:18,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436556141] [2022-11-02 21:02:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,343 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 21:02:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:18,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436556141] [2022-11-02 21:02:18,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436556141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:18,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:18,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611613325] [2022-11-02 21:02:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:18,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:18,346 INFO L87 Difference]: Start difference. First operand 3378 states and 4590 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:19,652 INFO L93 Difference]: Finished difference Result 4127 states and 5582 transitions. [2022-11-02 21:02:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-02 21:02:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:19,656 INFO L225 Difference]: With dead ends: 4127 [2022-11-02 21:02:19,656 INFO L226 Difference]: Without dead ends: 2783 [2022-11-02 21:02:19,658 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 21:02:19,659 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 148 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:19,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 477 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2022-11-02 21:02:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2781. [2022-11-02 21:02:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.3273381294964028) internal successors, (3690), 2780 states have internal predecessors, (3690), 0 states have call successors, (0), 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:02:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3690 transitions. [2022-11-02 21:02:20,521 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3690 transitions. Word has length 63 [2022-11-02 21:02:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:20,522 INFO L495 AbstractCegarLoop]: Abstraction has 2781 states and 3690 transitions. [2022-11-02 21:02:20,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:02:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3690 transitions. [2022-11-02 21:02:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:02:20,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:20,525 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] [2022-11-02 21:02:20,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:02:20,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash -424034558, now seen corresponding path program 1 times [2022-11-02 21:02:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:20,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607742831] [2022-11-02 21:02:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,029 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 21:02:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607742831] [2022-11-02 21:02:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607742831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:22,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:22,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:02:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725847094] [2022-11-02 21:02:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:22,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:02:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:02:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:02:22,031 INFO L87 Difference]: Start difference. First operand 2781 states and 3690 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:29,628 INFO L93 Difference]: Finished difference Result 6802 states and 9124 transitions. [2022-11-02 21:02:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 21:02:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:02:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:29,637 INFO L225 Difference]: With dead ends: 6802 [2022-11-02 21:02:29,637 INFO L226 Difference]: Without dead ends: 6735 [2022-11-02 21:02:29,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 21:02:29,640 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 2067 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 7018 SdHoareTripleChecker+Invalid, 3987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:29,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 7018 Invalid, 3987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 21:02:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2022-11-02 21:02:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 2787. [2022-11-02 21:02:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.3269921033740129) internal successors, (3697), 2786 states have internal predecessors, (3697), 0 states have call successors, (0), 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:02:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3697 transitions. [2022-11-02 21:02:30,549 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3697 transitions. Word has length 64 [2022-11-02 21:02:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:30,550 INFO L495 AbstractCegarLoop]: Abstraction has 2787 states and 3697 transitions. [2022-11-02 21:02:30,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3697 transitions. [2022-11-02 21:02:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:02:30,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:30,553 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] [2022-11-02 21:02:30,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:02:30,553 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 250019910, now seen corresponding path program 1 times [2022-11-02 21:02:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:30,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665116322] [2022-11-02 21:02:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:31,934 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 21:02:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:31,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665116322] [2022-11-02 21:02:31,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665116322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:31,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:31,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:02:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673068652] [2022-11-02 21:02:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:31,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:02:31,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:02:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:02:31,936 INFO L87 Difference]: Start difference. First operand 2787 states and 3697 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:40,841 INFO L93 Difference]: Finished difference Result 8295 states and 11159 transitions. [2022-11-02 21:02:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 21:02:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:02:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:40,850 INFO L225 Difference]: With dead ends: 8295 [2022-11-02 21:02:40,850 INFO L226 Difference]: Without dead ends: 8228 [2022-11-02 21:02:40,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2022-11-02 21:02:40,853 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 1962 mSDsluCounter, 7555 mSDsCounter, 0 mSdLazyCounter, 4391 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 8104 SdHoareTripleChecker+Invalid, 4419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:40,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 8104 Invalid, 4419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4391 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 21:02:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2022-11-02 21:02:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 2787. [2022-11-02 21:02:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.3266331658291457) internal successors, (3696), 2786 states have internal predecessors, (3696), 0 states have call successors, (0), 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:02:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3696 transitions. [2022-11-02 21:02:41,842 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3696 transitions. Word has length 64 [2022-11-02 21:02:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:41,843 INFO L495 AbstractCegarLoop]: Abstraction has 2787 states and 3696 transitions. [2022-11-02 21:02:41,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3696 transitions. [2022-11-02 21:02:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:02:41,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:41,846 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] [2022-11-02 21:02:41,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:02:41,846 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:41,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1940234754, now seen corresponding path program 1 times [2022-11-02 21:02:41,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:41,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916013329] [2022-11-02 21:02:41,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:43,297 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 21:02:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:43,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916013329] [2022-11-02 21:02:43,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916013329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:43,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:43,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-02 21:02:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302267669] [2022-11-02 21:02:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:43,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:02:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:43,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:02:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:02:43,300 INFO L87 Difference]: Start difference. First operand 2787 states and 3696 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:50,987 INFO L93 Difference]: Finished difference Result 6658 states and 8925 transitions. [2022-11-02 21:02:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 21:02:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:02:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:50,995 INFO L225 Difference]: With dead ends: 6658 [2022-11-02 21:02:50,995 INFO L226 Difference]: Without dead ends: 6591 [2022-11-02 21:02:50,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-11-02 21:02:50,998 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 2058 mSDsluCounter, 6058 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:50,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 6531 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 21:02:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2022-11-02 21:02:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 2799. [2022-11-02 21:02:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2798 states have (on average 1.3263045032165832) internal successors, (3711), 2798 states have internal predecessors, (3711), 0 states have call successors, (0), 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:02:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 3711 transitions. [2022-11-02 21:02:51,971 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 3711 transitions. Word has length 64 [2022-11-02 21:02:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:51,972 INFO L495 AbstractCegarLoop]: Abstraction has 2799 states and 3711 transitions. [2022-11-02 21:02:51,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3711 transitions. [2022-11-02 21:02:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:02:51,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:51,974 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] [2022-11-02 21:02:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:02:51,975 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1380487795, now seen corresponding path program 1 times [2022-11-02 21:02:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:51,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799422747] [2022-11-02 21:02:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:52,024 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 21:02:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:52,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799422747] [2022-11-02 21:02:52,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799422747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:52,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:52,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047359167] [2022-11-02 21:02:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:52,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:52,027 INFO L87 Difference]: Start difference. First operand 2799 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:53,886 INFO L93 Difference]: Finished difference Result 5042 states and 6736 transitions. [2022-11-02 21:02:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:02:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:53,891 INFO L225 Difference]: With dead ends: 5042 [2022-11-02 21:02:53,892 INFO L226 Difference]: Without dead ends: 3696 [2022-11-02 21:02:53,894 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 21:02:53,895 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 150 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:53,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 305 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2022-11-02 21:02:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2633. [2022-11-02 21:02:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2632 states have (on average 1.3248480243161094) internal successors, (3487), 2632 states have internal predecessors, (3487), 0 states have call successors, (0), 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:02:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3487 transitions. [2022-11-02 21:02:54,906 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3487 transitions. Word has length 64 [2022-11-02 21:02:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:54,906 INFO L495 AbstractCegarLoop]: Abstraction has 2633 states and 3487 transitions. [2022-11-02 21:02:54,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3487 transitions. [2022-11-02 21:02:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:02:54,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:54,909 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] [2022-11-02 21:02:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:02:54,910 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1914859187, now seen corresponding path program 1 times [2022-11-02 21:02:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:54,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727690408] [2022-11-02 21:02:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:54,949 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 21:02:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:54,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727690408] [2022-11-02 21:02:54,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727690408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:54,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:54,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811351860] [2022-11-02 21:02:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:54,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:54,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:54,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:54,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:54,955 INFO L87 Difference]: Start difference. First operand 2633 states and 3487 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:56,903 INFO L93 Difference]: Finished difference Result 4774 states and 6376 transitions. [2022-11-02 21:02:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:02:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:56,910 INFO L225 Difference]: With dead ends: 4774 [2022-11-02 21:02:56,910 INFO L226 Difference]: Without dead ends: 3450 [2022-11-02 21:02:56,912 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 21:02:56,914 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 152 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:56,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 306 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2022-11-02 21:02:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2453. [2022-11-02 21:02:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2452 states have (on average 1.3250407830342577) internal successors, (3249), 2452 states have internal predecessors, (3249), 0 states have call successors, (0), 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:02:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3249 transitions. [2022-11-02 21:02:57,898 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3249 transitions. Word has length 64 [2022-11-02 21:02:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3249 transitions. [2022-11-02 21:02:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3249 transitions. [2022-11-02 21:02:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:02:57,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:57,902 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] [2022-11-02 21:02:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:02:57,902 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1138559632, now seen corresponding path program 1 times [2022-11-02 21:02:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158969964] [2022-11-02 21:02:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:58,994 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 21:02:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:58,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158969964] [2022-11-02 21:02:58,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158969964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:58,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:58,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 21:02:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096071889] [2022-11-02 21:02:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:58,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:02:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:02:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:58,996 INFO L87 Difference]: Start difference. First operand 2453 states and 3249 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:07,551 INFO L93 Difference]: Finished difference Result 8760 states and 11781 transitions. [2022-11-02 21:03:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 21:03:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 21:03:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:07,560 INFO L225 Difference]: With dead ends: 8760 [2022-11-02 21:03:07,560 INFO L226 Difference]: Without dead ends: 8534 [2022-11-02 21:03:07,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=448, Invalid=1714, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 21:03:07,562 INFO L413 NwaCegarLoop]: 613 mSDtfsCounter, 2417 mSDsluCounter, 6602 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 7215 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:07,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 7215 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 21:03:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8534 states. [2022-11-02 21:03:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8534 to 2405. [2022-11-02 21:03:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2404 states have (on average 1.3248752079866888) internal successors, (3185), 2404 states have internal predecessors, (3185), 0 states have call successors, (0), 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:03:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3185 transitions. [2022-11-02 21:03:08,553 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3185 transitions. Word has length 65 [2022-11-02 21:03:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:08,553 INFO L495 AbstractCegarLoop]: Abstraction has 2405 states and 3185 transitions. [2022-11-02 21:03:08,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3185 transitions. [2022-11-02 21:03:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:03:08,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:08,556 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] [2022-11-02 21:03:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:03:08,556 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1339466768, now seen corresponding path program 1 times [2022-11-02 21:03:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:08,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051335197] [2022-11-02 21:03:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:09,163 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 21:03:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:09,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051335197] [2022-11-02 21:03:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051335197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:09,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:09,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:03:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390687566] [2022-11-02 21:03:09,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:09,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:09,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:09,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:09,165 INFO L87 Difference]: Start difference. First operand 2405 states and 3185 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:13,190 INFO L93 Difference]: Finished difference Result 5167 states and 6936 transitions. [2022-11-02 21:03:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:03:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 21:03:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:13,197 INFO L225 Difference]: With dead ends: 5167 [2022-11-02 21:03:13,197 INFO L226 Difference]: Without dead ends: 4815 [2022-11-02 21:03:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:03:13,199 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 1682 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:13,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 2045 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:03:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2022-11-02 21:03:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 2329. [2022-11-02 21:03:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2328 states have (on average 1.3260309278350515) internal successors, (3087), 2328 states have internal predecessors, (3087), 0 states have call successors, (0), 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:03:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3087 transitions. [2022-11-02 21:03:14,506 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3087 transitions. Word has length 65 [2022-11-02 21:03:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:14,506 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 3087 transitions. [2022-11-02 21:03:14,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3087 transitions. [2022-11-02 21:03:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:03:14,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:14,509 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] [2022-11-02 21:03:14,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:03:14,509 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash -427633856, now seen corresponding path program 1 times [2022-11-02 21:03:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:14,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971439787] [2022-11-02 21:03:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:14,617 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 21:03:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971439787] [2022-11-02 21:03:14,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971439787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:14,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:14,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:03:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132262669] [2022-11-02 21:03:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:03:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:03:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:14,620 INFO L87 Difference]: Start difference. First operand 2329 states and 3087 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:16,606 INFO L93 Difference]: Finished difference Result 2335 states and 3090 transitions. [2022-11-02 21:03:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:03:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-02 21:03:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:16,609 INFO L225 Difference]: With dead ends: 2335 [2022-11-02 21:03:16,609 INFO L226 Difference]: Without dead ends: 2128 [2022-11-02 21:03:16,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:16,610 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 495 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:16,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 603 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:03:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-11-02 21:03:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2124. [2022-11-02 21:03:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 1.3306641544983513) internal successors, (2825), 2123 states have internal predecessors, (2825), 0 states have call successors, (0), 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:03:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2825 transitions. [2022-11-02 21:03:17,780 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2825 transitions. Word has length 68 [2022-11-02 21:03:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:17,780 INFO L495 AbstractCegarLoop]: Abstraction has 2124 states and 2825 transitions. [2022-11-02 21:03:17,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2825 transitions. [2022-11-02 21:03:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 21:03:17,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:17,782 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] [2022-11-02 21:03:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:03:17,782 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1513353753, now seen corresponding path program 1 times [2022-11-02 21:03:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987081785] [2022-11-02 21:03:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:17,900 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 21:03:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987081785] [2022-11-02 21:03:17,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987081785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:17,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:17,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727300801] [2022-11-02 21:03:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:17,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:17,904 INFO L87 Difference]: Start difference. First operand 2124 states and 2825 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:20,651 INFO L93 Difference]: Finished difference Result 5403 states and 7287 transitions. [2022-11-02 21:03:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-02 21:03:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:20,655 INFO L225 Difference]: With dead ends: 5403 [2022-11-02 21:03:20,655 INFO L226 Difference]: Without dead ends: 3686 [2022-11-02 21:03:20,657 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 21:03:20,657 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 394 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 21:03:20,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:03:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-11-02 21:03:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3458. [2022-11-02 21:03:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.3358403239803298) internal successors, (4618), 3457 states have internal predecessors, (4618), 0 states have call successors, (0), 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:03:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4618 transitions. [2022-11-02 21:03:22,709 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4618 transitions. Word has length 71 [2022-11-02 21:03:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:22,710 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4618 transitions. [2022-11-02 21:03:22,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4618 transitions. [2022-11-02 21:03:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 21:03:22,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:22,712 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] [2022-11-02 21:03:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:03:22,713 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 87467842, now seen corresponding path program 1 times [2022-11-02 21:03:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927918100] [2022-11-02 21:03:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,814 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 21:03:22,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:22,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927918100] [2022-11-02 21:03:22,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927918100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:22,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:22,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022829293] [2022-11-02 21:03:22,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:22,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:22,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:22,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:22,818 INFO L87 Difference]: Start difference. First operand 3458 states and 4618 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:26,598 INFO L93 Difference]: Finished difference Result 9250 states and 12428 transitions. [2022-11-02 21:03:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-02 21:03:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:26,605 INFO L225 Difference]: With dead ends: 9250 [2022-11-02 21:03:26,605 INFO L226 Difference]: Without dead ends: 6199 [2022-11-02 21:03:26,608 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 21:03:26,609 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 385 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 21:03:26,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:03:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2022-11-02 21:03:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5745. [2022-11-02 21:03:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 5744 states have (on average 1.3314763231197773) internal successors, (7648), 5744 states have internal predecessors, (7648), 0 states have call successors, (0), 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:03:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 7648 transitions. [2022-11-02 21:03:29,929 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 7648 transitions. Word has length 72 [2022-11-02 21:03:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:29,929 INFO L495 AbstractCegarLoop]: Abstraction has 5745 states and 7648 transitions. [2022-11-02 21:03:29,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 7648 transitions. [2022-11-02 21:03:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 21:03:29,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:29,931 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] [2022-11-02 21:03:29,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:03:29,932 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1178358807, now seen corresponding path program 1 times [2022-11-02 21:03:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:29,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848948084] [2022-11-02 21:03:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:30,030 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 21:03:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848948084] [2022-11-02 21:03:30,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848948084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:30,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:30,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071519569] [2022-11-02 21:03:30,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:30,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:30,033 INFO L87 Difference]: Start difference. First operand 5745 states and 7648 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:36,072 INFO L93 Difference]: Finished difference Result 15708 states and 20885 transitions. [2022-11-02 21:03:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-02 21:03:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:36,084 INFO L225 Difference]: With dead ends: 15708 [2022-11-02 21:03:36,084 INFO L226 Difference]: Without dead ends: 10298 [2022-11-02 21:03:36,088 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 21:03:36,089 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 98 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:36,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 370 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:03:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10298 states. [2022-11-02 21:03:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10298 to 9504. [2022-11-02 21:03:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9504 states, 9503 states have (on average 1.318636220141008) internal successors, (12531), 9503 states have internal predecessors, (12531), 0 states have call successors, (0), 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:03:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9504 states to 9504 states and 12531 transitions. [2022-11-02 21:03:41,419 INFO L78 Accepts]: Start accepts. Automaton has 9504 states and 12531 transitions. Word has length 74 [2022-11-02 21:03:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:41,419 INFO L495 AbstractCegarLoop]: Abstraction has 9504 states and 12531 transitions. [2022-11-02 21:03:41,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9504 states and 12531 transitions. [2022-11-02 21:03:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 21:03:41,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:41,421 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] [2022-11-02 21:03:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:03:41,421 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1504202340, now seen corresponding path program 1 times [2022-11-02 21:03:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:41,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963380942] [2022-11-02 21:03:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:41,590 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 21:03:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:41,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963380942] [2022-11-02 21:03:41,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963380942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:41,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:41,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:03:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901724612] [2022-11-02 21:03:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:03:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:03:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:03:41,594 INFO L87 Difference]: Start difference. First operand 9504 states and 12531 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:54,340 INFO L93 Difference]: Finished difference Result 20282 states and 26364 transitions. [2022-11-02 21:03:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:03:54,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-02 21:03:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:54,365 INFO L225 Difference]: With dead ends: 20282 [2022-11-02 21:03:54,365 INFO L226 Difference]: Without dead ends: 20280 [2022-11-02 21:03:54,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:03:54,369 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 295 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:54,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 903 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:03:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2022-11-02 21:04:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 10488. [2022-11-02 21:04:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10488 states, 10487 states have (on average 1.2887384380661773) internal successors, (13515), 10487 states have internal predecessors, (13515), 0 states have call successors, (0), 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:04:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10488 states to 10488 states and 13515 transitions. [2022-11-02 21:04:01,021 INFO L78 Accepts]: Start accepts. Automaton has 10488 states and 13515 transitions. Word has length 75 [2022-11-02 21:04:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:01,022 INFO L495 AbstractCegarLoop]: Abstraction has 10488 states and 13515 transitions. [2022-11-02 21:04:01,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10488 states and 13515 transitions. [2022-11-02 21:04:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 21:04:01,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:01,024 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] [2022-11-02 21:04:01,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:04:01,024 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1668309570, now seen corresponding path program 1 times [2022-11-02 21:04:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:01,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563541849] [2022-11-02 21:04:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:01,099 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 21:04:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:01,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563541849] [2022-11-02 21:04:01,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563541849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:01,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:01,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516082771] [2022-11-02 21:04:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:01,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:01,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:01,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:01,102 INFO L87 Difference]: Start difference. First operand 10488 states and 13515 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:10,985 INFO L93 Difference]: Finished difference Result 25636 states and 32849 transitions. [2022-11-02 21:04:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 21:04:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:11,002 INFO L225 Difference]: With dead ends: 25636 [2022-11-02 21:04:11,003 INFO L226 Difference]: Without dead ends: 15494 [2022-11-02 21:04:11,009 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 21:04:11,009 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 113 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15494 states. [2022-11-02 21:04:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15494 to 15492. [2022-11-02 21:04:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15492 states, 15491 states have (on average 1.2618294493576916) internal successors, (19547), 15491 states have internal predecessors, (19547), 0 states have call successors, (0), 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:04:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15492 states to 15492 states and 19547 transitions. [2022-11-02 21:04:20,336 INFO L78 Accepts]: Start accepts. Automaton has 15492 states and 19547 transitions. Word has length 76 [2022-11-02 21:04:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:20,337 INFO L495 AbstractCegarLoop]: Abstraction has 15492 states and 19547 transitions. [2022-11-02 21:04:20,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15492 states and 19547 transitions. [2022-11-02 21:04:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:04:20,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:20,341 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:04:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:04:20,341 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1627547032, now seen corresponding path program 1 times [2022-11-02 21:04:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:20,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235989502] [2022-11-02 21:04:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235989502] [2022-11-02 21:04:20,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235989502] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307294644] [2022-11-02 21:04:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:20,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:20,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1869bf8f-2bde-4e7d-b976-87388c089686/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 21:04:20,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:23,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:24,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307294644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:24,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:24,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2022-11-02 21:04:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708251075] [2022-11-02 21:04:24,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 21:04:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 21:04:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 21:04:24,622 INFO L87 Difference]: Start difference. First operand 15492 states and 19547 transitions. Second operand has 33 states, 33 states have (on average 7.7272727272727275) internal successors, (255), 32 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)