./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem10.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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:34:33,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:34:33,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:34:33,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:34:33,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:34:33,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:34:33,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:34:33,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:34:33,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:34:33,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:34:33,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:34:33,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:34:33,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:34:33,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:34:33,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:34:33,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:34:33,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:34:33,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:34:33,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:34:33,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:34:33,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:34:33,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:34:33,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:34:33,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:34:33,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:34:33,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:34:33,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:34:33,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:34:33,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:34:33,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:34:33,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:34:34,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:34:34,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:34:34,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:34:34,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:34:34,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:34:34,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:34:34,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:34:34,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:34:34,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:34:34,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:34:34,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:34:34,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:34:34,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:34:34,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:34:34,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:34:34,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:34:34,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:34:34,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:34:34,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:34:34,050 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:34:34,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:34:34,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:34:34,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:34:34,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:34:34,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:34:34,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:34:34,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:34:34,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:34:34,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:34:34,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:34:34,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:34:34,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:34:34,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:34:34,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:34:34,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:34:34,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:34,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:34:34,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:34:34,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:34:34,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:34:34,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:34:34,056 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:34:34,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:34:34,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:34:34,057 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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2022-11-02 20:34:34,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:34:34,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:34:34,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:34:34,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:34:34,456 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:34:34,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-02 20:34:34,564 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/data/e7e8cf6d5/aeac53d4f19341d3b0419efe5b4f4427/FLAG7fee28311 [2022-11-02 20:34:35,228 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:34:35,229 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-02 20:34:35,258 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/data/e7e8cf6d5/aeac53d4f19341d3b0419efe5b4f4427/FLAG7fee28311 [2022-11-02 20:34:35,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/data/e7e8cf6d5/aeac53d4f19341d3b0419efe5b4f4427 [2022-11-02 20:34:35,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:34:35,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:34:35,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:35,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:34:35,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:34:35,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:35" (1/1) ... [2022-11-02 20:34:35,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708ba224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:35, skipping insertion in model container [2022-11-02 20:34:35,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:34:35" (1/1) ... [2022-11-02 20:34:35,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:34:35,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:34:35,777 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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-02 20:34:35,782 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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-02 20:34:36,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:36,187 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:34:36,199 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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-02 20:34:36,200 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_15acd0e6-3a91-4982-bc60-a602d6d0d2de/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-02 20:34:36,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:34:36,417 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:34:36,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36 WrapperNode [2022-11-02 20:34:36,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:34:36,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:36,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:34:36,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:34:36,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,554 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 865 [2022-11-02 20:34:36,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:34:36,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:34:36,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:34:36,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:34:36,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,599 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:34:36,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:34:36,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:34:36,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:34:36,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (1/1) ... [2022-11-02 20:34:36,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:34:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:34:36,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:34:36,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15acd0e6-3a91-4982-bc60-a602d6d0d2de/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2022-11-02 20:34:36,735 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2022-11-02 20:34:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2022-11-02 20:34:36,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2022-11-02 20:34:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:34:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:34:36,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:34:36,908 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:34:36,911 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:34:38,068 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:34:38,085 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:34:38,086 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:34:38,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:38 BoogieIcfgContainer [2022-11-02 20:34:38,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:34:38,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:34:38,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:34:38,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:34:38,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:34:35" (1/3) ... [2022-11-02 20:34:38,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b16fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:38, skipping insertion in model container [2022-11-02 20:34:38,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:34:36" (2/3) ... [2022-11-02 20:34:38,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b16fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:34:38, skipping insertion in model container [2022-11-02 20:34:38,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:34:38" (3/3) ... [2022-11-02 20:34:38,098 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2022-11-02 20:34:38,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:34:38,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:34:38,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:34:38,218 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;@3db6aa9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:34:38,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:34:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-02 20:34:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:34:38,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:38,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:38,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1184212657, now seen corresponding path program 1 times [2022-11-02 20:34:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:38,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031334544] [2022-11-02 20:34:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:38,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031334544] [2022-11-02 20:34:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031334544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065705955] [2022-11-02 20:34:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:38,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:38,575 INFO L87 Difference]: Start difference. First operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:40,149 INFO L93 Difference]: Finished difference Result 1165 states and 2069 transitions. [2022-11-02 20:34:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:34:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:40,171 INFO L225 Difference]: With dead ends: 1165 [2022-11-02 20:34:40,171 INFO L226 Difference]: Without dead ends: 690 [2022-11-02 20:34:40,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:40,181 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 373 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:40,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 772 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:34:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-02 20:34:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 557. [2022-11-02 20:34:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 455 states have (on average 1.589010989010989) internal successors, (723), 554 states have internal predecessors, (723), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 823 transitions. [2022-11-02 20:34:40,289 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 823 transitions. Word has length 13 [2022-11-02 20:34:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:40,294 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 823 transitions. [2022-11-02 20:34:40,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2022-11-02 20:34:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:34:40,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:40,298 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] [2022-11-02 20:34:40,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:34:40,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash -249172658, now seen corresponding path program 1 times [2022-11-02 20:34:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:40,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652990613] [2022-11-02 20:34:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:40,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652990613] [2022-11-02 20:34:40,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652990613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:40,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:40,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816687816] [2022-11-02 20:34:40,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:40,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:40,437 INFO L87 Difference]: Start difference. First operand 557 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:41,263 INFO L93 Difference]: Finished difference Result 1704 states and 2582 transitions. [2022-11-02 20:34:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:34:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:34:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:41,269 INFO L225 Difference]: With dead ends: 1704 [2022-11-02 20:34:41,269 INFO L226 Difference]: Without dead ends: 1149 [2022-11-02 20:34:41,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:41,275 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 845 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:41,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1116 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:34:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-11-02 20:34:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 888. [2022-11-02 20:34:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5521628498727735) internal successors, (1220), 885 states have internal predecessors, (1220), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1320 transitions. [2022-11-02 20:34:41,327 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1320 transitions. Word has length 21 [2022-11-02 20:34:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:41,331 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1320 transitions. [2022-11-02 20:34:41,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1320 transitions. [2022-11-02 20:34:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:34:41,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:41,336 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] [2022-11-02 20:34:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:34:41,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1086962958, now seen corresponding path program 1 times [2022-11-02 20:34:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:41,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690679945] [2022-11-02 20:34:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:41,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690679945] [2022-11-02 20:34:41,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690679945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:41,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164557303] [2022-11-02 20:34:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:41,573 INFO L87 Difference]: Start difference. First operand 888 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:41,623 INFO L93 Difference]: Finished difference Result 2645 states and 3935 transitions. [2022-11-02 20:34:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:34:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:41,630 INFO L225 Difference]: With dead ends: 2645 [2022-11-02 20:34:41,630 INFO L226 Difference]: Without dead ends: 1759 [2022-11-02 20:34:41,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:41,634 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 461 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:41,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-11-02 20:34:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 888. [2022-11-02 20:34:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5508905852417303) internal successors, (1219), 885 states have internal predecessors, (1219), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1319 transitions. [2022-11-02 20:34:41,672 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1319 transitions. Word has length 24 [2022-11-02 20:34:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:41,673 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1319 transitions. [2022-11-02 20:34:41,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1319 transitions. [2022-11-02 20:34:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:34:41,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:41,677 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] [2022-11-02 20:34:41,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:34:41,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1345128396, now seen corresponding path program 1 times [2022-11-02 20:34:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:41,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077914015] [2022-11-02 20:34:41,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:41,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077914015] [2022-11-02 20:34:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077914015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:41,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:41,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474565144] [2022-11-02 20:34:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:41,761 INFO L87 Difference]: Start difference. First operand 888 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:41,978 INFO L93 Difference]: Finished difference Result 2201 states and 3265 transitions. [2022-11-02 20:34:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:34:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:41,983 INFO L225 Difference]: With dead ends: 2201 [2022-11-02 20:34:41,984 INFO L226 Difference]: Without dead ends: 1315 [2022-11-02 20:34:41,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:41,996 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 533 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:41,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1382 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-11-02 20:34:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1231. [2022-11-02 20:34:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1129 states have (on average 1.5491585473870682) internal successors, (1749), 1228 states have internal predecessors, (1749), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1849 transitions. [2022-11-02 20:34:42,036 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1849 transitions. Word has length 24 [2022-11-02 20:34:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:42,036 INFO L495 AbstractCegarLoop]: Abstraction has 1231 states and 1849 transitions. [2022-11-02 20:34:42,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1849 transitions. [2022-11-02 20:34:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:34:42,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:42,038 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] [2022-11-02 20:34:42,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:34:42,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 500156944, now seen corresponding path program 1 times [2022-11-02 20:34:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:42,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972061742] [2022-11-02 20:34:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:42,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:42,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972061742] [2022-11-02 20:34:42,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972061742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:42,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:42,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165474998] [2022-11-02 20:34:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:42,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:42,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:42,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:42,111 INFO L87 Difference]: Start difference. First operand 1231 states and 1849 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:42,668 INFO L93 Difference]: Finished difference Result 3169 states and 4832 transitions. [2022-11-02 20:34:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:42,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:34:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:42,678 INFO L225 Difference]: With dead ends: 3169 [2022-11-02 20:34:42,679 INFO L226 Difference]: Without dead ends: 1940 [2022-11-02 20:34:42,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:42,684 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 310 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:42,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 801 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:34:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2022-11-02 20:34:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1397. [2022-11-02 20:34:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1295 states have (on average 1.4517374517374517) internal successors, (1880), 1394 states have internal predecessors, (1880), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1980 transitions. [2022-11-02 20:34:42,764 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1980 transitions. Word has length 24 [2022-11-02 20:34:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:42,764 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 1980 transitions. [2022-11-02 20:34:42,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1980 transitions. [2022-11-02 20:34:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:34:42,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:42,771 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] [2022-11-02 20:34:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:34:42,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221522, now seen corresponding path program 1 times [2022-11-02 20:34:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:42,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948580093] [2022-11-02 20:34:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:42,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948580093] [2022-11-02 20:34:42,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948580093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:42,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:42,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:34:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511763335] [2022-11-02 20:34:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:42,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:42,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:42,818 INFO L87 Difference]: Start difference. First operand 1397 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:42,946 INFO L93 Difference]: Finished difference Result 4140 states and 5880 transitions. [2022-11-02 20:34:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:34:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:42,955 INFO L225 Difference]: With dead ends: 4140 [2022-11-02 20:34:42,956 INFO L226 Difference]: Without dead ends: 2745 [2022-11-02 20:34:42,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:42,959 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 510 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:42,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1073 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2022-11-02 20:34:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2657. [2022-11-02 20:34:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2555 states have (on average 1.4348336594911937) internal successors, (3666), 2654 states have internal predecessors, (3666), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3766 transitions. [2022-11-02 20:34:43,033 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3766 transitions. Word has length 24 [2022-11-02 20:34:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:43,033 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 3766 transitions. [2022-11-02 20:34:43,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3766 transitions. [2022-11-02 20:34:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:34:43,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:43,035 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] [2022-11-02 20:34:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:34:43,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1417555436, now seen corresponding path program 1 times [2022-11-02 20:34:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:43,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565438038] [2022-11-02 20:34:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:43,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565438038] [2022-11-02 20:34:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565438038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:43,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024018319] [2022-11-02 20:34:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:43,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:43,073 INFO L87 Difference]: Start difference. First operand 2657 states and 3766 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:43,688 INFO L93 Difference]: Finished difference Result 6143 states and 8908 transitions. [2022-11-02 20:34:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:34:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:43,700 INFO L225 Difference]: With dead ends: 6143 [2022-11-02 20:34:43,700 INFO L226 Difference]: Without dead ends: 3488 [2022-11-02 20:34:43,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:43,705 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 230 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:43,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 722 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:34:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2022-11-02 20:34:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3484. [2022-11-02 20:34:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3382 states have (on average 1.3746303962152573) internal successors, (4649), 3481 states have internal predecessors, (4649), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4749 transitions. [2022-11-02 20:34:43,797 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4749 transitions. Word has length 25 [2022-11-02 20:34:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:43,798 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4749 transitions. [2022-11-02 20:34:43,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4749 transitions. [2022-11-02 20:34:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:34:43,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:43,801 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] [2022-11-02 20:34:43,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:34:43,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2032440408, now seen corresponding path program 1 times [2022-11-02 20:34:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:43,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404501403] [2022-11-02 20:34:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404501403] [2022-11-02 20:34:43,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404501403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:43,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:43,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258102517] [2022-11-02 20:34:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:43,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:43,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:43,849 INFO L87 Difference]: Start difference. First operand 3484 states and 4749 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:44,496 INFO L93 Difference]: Finished difference Result 7813 states and 10890 transitions. [2022-11-02 20:34:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:34:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:44,509 INFO L225 Difference]: With dead ends: 7813 [2022-11-02 20:34:44,509 INFO L226 Difference]: Without dead ends: 4331 [2022-11-02 20:34:44,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:44,515 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:44,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 682 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:34:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2022-11-02 20:34:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4327. [2022-11-02 20:34:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 4225 states have (on average 1.353846153846154) internal successors, (5720), 4324 states have internal predecessors, (5720), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5820 transitions. [2022-11-02 20:34:44,615 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5820 transitions. Word has length 25 [2022-11-02 20:34:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:44,617 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5820 transitions. [2022-11-02 20:34:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5820 transitions. [2022-11-02 20:34:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:34:44,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:44,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] [2022-11-02 20:34:44,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:34:44,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -995255721, now seen corresponding path program 1 times [2022-11-02 20:34:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:44,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783800765] [2022-11-02 20:34:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:44,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783800765] [2022-11-02 20:34:44,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783800765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:44,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:44,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440296734] [2022-11-02 20:34:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:44,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:44,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:44,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:44,668 INFO L87 Difference]: Start difference. First operand 4327 states and 5820 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:44,795 INFO L93 Difference]: Finished difference Result 8549 states and 11509 transitions. [2022-11-02 20:34:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:34:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:44,823 INFO L225 Difference]: With dead ends: 8549 [2022-11-02 20:34:44,823 INFO L226 Difference]: Without dead ends: 8542 [2022-11-02 20:34:44,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:44,826 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 548 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:44,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2022-11-02 20:34:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8441. [2022-11-02 20:34:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8339 states have (on average 1.3492025422712555) internal successors, (11251), 8438 states have internal predecessors, (11251), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 11351 transitions. [2022-11-02 20:34:45,012 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 11351 transitions. Word has length 26 [2022-11-02 20:34:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:45,013 INFO L495 AbstractCegarLoop]: Abstraction has 8441 states and 11351 transitions. [2022-11-02 20:34:45,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 11351 transitions. [2022-11-02 20:34:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:34:45,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:45,014 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] [2022-11-02 20:34:45,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:34:45,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1419566957, now seen corresponding path program 1 times [2022-11-02 20:34:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:45,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054413022] [2022-11-02 20:34:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:45,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054413022] [2022-11-02 20:34:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054413022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:45,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:45,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:34:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309426273] [2022-11-02 20:34:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:45,053 INFO L87 Difference]: Start difference. First operand 8441 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:45,193 INFO L93 Difference]: Finished difference Result 16979 states and 22797 transitions. [2022-11-02 20:34:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:34:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:45,211 INFO L225 Difference]: With dead ends: 16979 [2022-11-02 20:34:45,211 INFO L226 Difference]: Without dead ends: 8540 [2022-11-02 20:34:45,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:45,222 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 533 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:45,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1209 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2022-11-02 20:34:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8439. [2022-11-02 20:34:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8439 states, 8339 states have (on average 1.3441659671423432) internal successors, (11209), 8436 states have internal predecessors, (11209), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 11307 transitions. [2022-11-02 20:34:45,456 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 11307 transitions. Word has length 26 [2022-11-02 20:34:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:45,457 INFO L495 AbstractCegarLoop]: Abstraction has 8439 states and 11307 transitions. [2022-11-02 20:34:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 11307 transitions. [2022-11-02 20:34:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:34:45,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:45,458 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] [2022-11-02 20:34:45,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:34:45,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1314457887, now seen corresponding path program 1 times [2022-11-02 20:34:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690721648] [2022-11-02 20:34:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690721648] [2022-11-02 20:34:45,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690721648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:45,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:45,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:34:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254922973] [2022-11-02 20:34:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:45,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:45,508 INFO L87 Difference]: Start difference. First operand 8439 states and 11307 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:45,764 INFO L93 Difference]: Finished difference Result 25142 states and 33722 transitions. [2022-11-02 20:34:45,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:45,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:34:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:45,807 INFO L225 Difference]: With dead ends: 25142 [2022-11-02 20:34:45,807 INFO L226 Difference]: Without dead ends: 16705 [2022-11-02 20:34:45,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:45,819 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 526 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:45,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:34:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2022-11-02 20:34:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16607. [2022-11-02 20:34:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16607 states, 16507 states have (on average 1.3390076937057007) internal successors, (22103), 16604 states have internal predecessors, (22103), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16607 states to 16607 states and 22201 transitions. [2022-11-02 20:34:46,232 INFO L78 Accepts]: Start accepts. Automaton has 16607 states and 22201 transitions. Word has length 28 [2022-11-02 20:34:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:46,232 INFO L495 AbstractCegarLoop]: Abstraction has 16607 states and 22201 transitions. [2022-11-02 20:34:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16607 states and 22201 transitions. [2022-11-02 20:34:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:34:46,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:46,234 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] [2022-11-02 20:34:46,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:34:46,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1594983404, now seen corresponding path program 1 times [2022-11-02 20:34:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:46,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193517657] [2022-11-02 20:34:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193517657] [2022-11-02 20:34:46,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193517657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:46,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:46,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661289372] [2022-11-02 20:34:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:46,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:46,292 INFO L87 Difference]: Start difference. First operand 16607 states and 22201 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:46,668 INFO L93 Difference]: Finished difference Result 48238 states and 64732 transitions. [2022-11-02 20:34:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:34:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:46,796 INFO L225 Difference]: With dead ends: 48238 [2022-11-02 20:34:46,796 INFO L226 Difference]: Without dead ends: 31633 [2022-11-02 20:34:46,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:46,813 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 504 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:46,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1352 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31633 states. [2022-11-02 20:34:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31633 to 31544. [2022-11-02 20:34:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31544 states, 31444 states have (on average 1.3317644065640504) internal successors, (41876), 31541 states have internal predecessors, (41876), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31544 states to 31544 states and 41974 transitions. [2022-11-02 20:34:47,894 INFO L78 Accepts]: Start accepts. Automaton has 31544 states and 41974 transitions. Word has length 33 [2022-11-02 20:34:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:47,894 INFO L495 AbstractCegarLoop]: Abstraction has 31544 states and 41974 transitions. [2022-11-02 20:34:47,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 31544 states and 41974 transitions. [2022-11-02 20:34:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:34:47,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:47,895 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] [2022-11-02 20:34:47,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:34:47,896 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash 132362279, now seen corresponding path program 1 times [2022-11-02 20:34:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:47,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005043854] [2022-11-02 20:34:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005043854] [2022-11-02 20:34:47,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005043854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:47,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:47,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782419445] [2022-11-02 20:34:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:47,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:47,935 INFO L87 Difference]: Start difference. First operand 31544 states and 41974 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:48,489 INFO L93 Difference]: Finished difference Result 73175 states and 97409 transitions. [2022-11-02 20:34:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:34:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:48,716 INFO L225 Difference]: With dead ends: 73175 [2022-11-02 20:34:48,717 INFO L226 Difference]: Without dead ends: 41633 [2022-11-02 20:34:48,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:48,741 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 483 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:48,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 965 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41633 states. [2022-11-02 20:34:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41633 to 41551. [2022-11-02 20:34:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41551 states, 41451 states have (on average 1.3153603049383609) internal successors, (54523), 41548 states have internal predecessors, (54523), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41551 states to 41551 states and 54621 transitions. [2022-11-02 20:34:49,839 INFO L78 Accepts]: Start accepts. Automaton has 41551 states and 54621 transitions. Word has length 34 [2022-11-02 20:34:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:49,841 INFO L495 AbstractCegarLoop]: Abstraction has 41551 states and 54621 transitions. [2022-11-02 20:34:49,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 41551 states and 54621 transitions. [2022-11-02 20:34:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:34:49,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:49,842 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] [2022-11-02 20:34:49,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:34:49,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -209128006, now seen corresponding path program 1 times [2022-11-02 20:34:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138996422] [2022-11-02 20:34:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138996422] [2022-11-02 20:34:50,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138996422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:50,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:50,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348948900] [2022-11-02 20:34:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:50,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:50,070 INFO L87 Difference]: Start difference. First operand 41551 states and 54621 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:50,737 INFO L93 Difference]: Finished difference Result 105458 states and 138388 transitions. [2022-11-02 20:34:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-02 20:34:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:50,875 INFO L225 Difference]: With dead ends: 105458 [2022-11-02 20:34:50,876 INFO L226 Difference]: Without dead ends: 63909 [2022-11-02 20:34:50,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:50,905 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 440 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:50,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1445 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:34:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63909 states. [2022-11-02 20:34:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63909 to 59950. [2022-11-02 20:34:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59950 states, 59850 states have (on average 1.2822222222222222) internal successors, (76741), 59947 states have internal predecessors, (76741), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 76839 transitions. [2022-11-02 20:34:52,344 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 76839 transitions. Word has length 40 [2022-11-02 20:34:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:52,344 INFO L495 AbstractCegarLoop]: Abstraction has 59950 states and 76839 transitions. [2022-11-02 20:34:52,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 76839 transitions. [2022-11-02 20:34:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:34:52,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:52,345 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] [2022-11-02 20:34:52,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:34:52,346 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1653138166, now seen corresponding path program 1 times [2022-11-02 20:34:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:52,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922855118] [2022-11-02 20:34:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:52,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922855118] [2022-11-02 20:34:52,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922855118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:52,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:52,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:34:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841871901] [2022-11-02 20:34:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:52,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:52,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:52,407 INFO L87 Difference]: Start difference. First operand 59950 states and 76839 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:53,507 INFO L93 Difference]: Finished difference Result 157117 states and 202813 transitions. [2022-11-02 20:34:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:53,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-02 20:34:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:53,739 INFO L225 Difference]: With dead ends: 157117 [2022-11-02 20:34:53,739 INFO L226 Difference]: Without dead ends: 97169 [2022-11-02 20:34:53,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:53,773 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 450 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:53,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 984 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:34:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97169 states. [2022-11-02 20:34:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97169 to 97090. [2022-11-02 20:34:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97090 states, 96990 states have (on average 1.274615939787607) internal successors, (123625), 97087 states have internal predecessors, (123625), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97090 states to 97090 states and 123723 transitions. [2022-11-02 20:34:55,242 INFO L78 Accepts]: Start accepts. Automaton has 97090 states and 123723 transitions. Word has length 40 [2022-11-02 20:34:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:55,243 INFO L495 AbstractCegarLoop]: Abstraction has 97090 states and 123723 transitions. [2022-11-02 20:34:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 97090 states and 123723 transitions. [2022-11-02 20:34:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:34:55,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:55,244 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] [2022-11-02 20:34:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:34:55,245 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1240470838, now seen corresponding path program 1 times [2022-11-02 20:34:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:55,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801107979] [2022-11-02 20:34:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801107979] [2022-11-02 20:34:55,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801107979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:55,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:55,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018689721] [2022-11-02 20:34:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:55,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:34:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:34:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:55,293 INFO L87 Difference]: Start difference. First operand 97090 states and 123723 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:56,479 INFO L93 Difference]: Finished difference Result 174054 states and 221151 transitions. [2022-11-02 20:34:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:34:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:34:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:57,058 INFO L225 Difference]: With dead ends: 174054 [2022-11-02 20:34:57,058 INFO L226 Difference]: Without dead ends: 174051 [2022-11-02 20:34:57,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:34:57,077 INFO L413 NwaCegarLoop]: 1036 mSDtfsCounter, 527 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:57,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1576 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:34:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174051 states. [2022-11-02 20:34:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174051 to 173830. [2022-11-02 20:34:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173830 states, 173730 states have (on average 1.269723133598112) internal successors, (220589), 173827 states have internal predecessors, (220589), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173830 states to 173830 states and 220687 transitions. [2022-11-02 20:34:59,429 INFO L78 Accepts]: Start accepts. Automaton has 173830 states and 220687 transitions. Word has length 45 [2022-11-02 20:34:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:59,430 INFO L495 AbstractCegarLoop]: Abstraction has 173830 states and 220687 transitions. [2022-11-02 20:34:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:34:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 173830 states and 220687 transitions. [2022-11-02 20:34:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:34:59,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:59,431 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] [2022-11-02 20:34:59,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:34:59,431 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1976305641, now seen corresponding path program 1 times [2022-11-02 20:34:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:59,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332780169] [2022-11-02 20:34:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:34:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:59,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332780169] [2022-11-02 20:34:59,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332780169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:59,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:59,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:34:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29613358] [2022-11-02 20:34:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:34:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:59,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:34:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:34:59,514 INFO L87 Difference]: Start difference. First operand 173830 states and 220687 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:02,658 INFO L93 Difference]: Finished difference Result 454683 states and 576582 transitions. [2022-11-02 20:35:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:35:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 20:35:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:03,145 INFO L225 Difference]: With dead ends: 454683 [2022-11-02 20:35:03,146 INFO L226 Difference]: Without dead ends: 280855 [2022-11-02 20:35:03,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:35:03,222 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 695 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:03,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 725 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:35:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280855 states. [2022-11-02 20:35:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280855 to 173825. [2022-11-02 20:35:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173825 states, 173730 states have (on average 1.2597075922408334) internal successors, (218849), 173822 states have internal predecessors, (218849), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173825 states to 173825 states and 218942 transitions. [2022-11-02 20:35:06,219 INFO L78 Accepts]: Start accepts. Automaton has 173825 states and 218942 transitions. Word has length 48 [2022-11-02 20:35:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:06,220 INFO L495 AbstractCegarLoop]: Abstraction has 173825 states and 218942 transitions. [2022-11-02 20:35:06,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 173825 states and 218942 transitions. [2022-11-02 20:35:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:35:06,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:06,221 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 20:35:06,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:35:06,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash 951319779, now seen corresponding path program 1 times [2022-11-02 20:35:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:06,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465703472] [2022-11-02 20:35:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:06,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465703472] [2022-11-02 20:35:06,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465703472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:06,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:06,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308186610] [2022-11-02 20:35:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:06,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:06,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:06,295 INFO L87 Difference]: Start difference. First operand 173825 states and 218942 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:08,356 INFO L93 Difference]: Finished difference Result 343392 states and 432799 transitions. [2022-11-02 20:35:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 20:35:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:09,232 INFO L225 Difference]: With dead ends: 343392 [2022-11-02 20:35:09,246 INFO L226 Difference]: Without dead ends: 169569 [2022-11-02 20:35:09,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:09,373 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 389 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:09,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 361 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:35:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169569 states. [2022-11-02 20:35:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169569 to 89809. [2022-11-02 20:35:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89809 states, 89714 states have (on average 1.2017299418151013) internal successors, (107812), 89806 states have internal predecessors, (107812), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89809 states to 89809 states and 107905 transitions. [2022-11-02 20:35:11,034 INFO L78 Accepts]: Start accepts. Automaton has 89809 states and 107905 transitions. Word has length 58 [2022-11-02 20:35:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:11,034 INFO L495 AbstractCegarLoop]: Abstraction has 89809 states and 107905 transitions. [2022-11-02 20:35:11,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 89809 states and 107905 transitions. [2022-11-02 20:35:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:35:11,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:11,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:35:11,037 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1754865588, now seen corresponding path program 1 times [2022-11-02 20:35:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166556892] [2022-11-02 20:35:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166556892] [2022-11-02 20:35:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166556892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:11,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:11,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350264695] [2022-11-02 20:35:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:11,160 INFO L87 Difference]: Start difference. First operand 89809 states and 107905 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:11,786 INFO L93 Difference]: Finished difference Result 128298 states and 153371 transitions. [2022-11-02 20:35:11,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:11,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-11-02 20:35:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:11,967 INFO L225 Difference]: With dead ends: 128298 [2022-11-02 20:35:11,968 INFO L226 Difference]: Without dead ends: 128293 [2022-11-02 20:35:11,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:11,999 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 445 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:11,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1264 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:35:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128293 states. [2022-11-02 20:35:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128293 to 128079. [2022-11-02 20:35:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128079 states, 127984 states have (on average 1.1906722715339417) internal successors, (152387), 128076 states have internal predecessors, (152387), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128079 states to 128079 states and 152480 transitions. [2022-11-02 20:35:14,144 INFO L78 Accepts]: Start accepts. Automaton has 128079 states and 152480 transitions. Word has length 113 [2022-11-02 20:35:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:14,145 INFO L495 AbstractCegarLoop]: Abstraction has 128079 states and 152480 transitions. [2022-11-02 20:35:14,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 128079 states and 152480 transitions. [2022-11-02 20:35:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-02 20:35:14,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:14,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:14,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:35:14,148 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash 149557454, now seen corresponding path program 1 times [2022-11-02 20:35:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:14,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259319224] [2022-11-02 20:35:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:35:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259319224] [2022-11-02 20:35:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259319224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:14,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386122260] [2022-11-02 20:35:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:14,253 INFO L87 Difference]: Start difference. First operand 128079 states and 152480 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:16,005 INFO L93 Difference]: Finished difference Result 275491 states and 332198 transitions. [2022-11-02 20:35:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-11-02 20:35:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:16,162 INFO L225 Difference]: With dead ends: 275491 [2022-11-02 20:35:16,162 INFO L226 Difference]: Without dead ends: 147535 [2022-11-02 20:35:16,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:16,197 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 518 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:35:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147535 states. [2022-11-02 20:35:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147535 to 147227. [2022-11-02 20:35:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147227 states, 147132 states have (on average 1.1926773237636952) internal successors, (175481), 147224 states have internal predecessors, (175481), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147227 states to 147227 states and 175574 transitions. [2022-11-02 20:35:18,238 INFO L78 Accepts]: Start accepts. Automaton has 147227 states and 175574 transitions. Word has length 144 [2022-11-02 20:35:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:18,238 INFO L495 AbstractCegarLoop]: Abstraction has 147227 states and 175574 transitions. [2022-11-02 20:35:18,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 147227 states and 175574 transitions. [2022-11-02 20:35:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-02 20:35:18,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:18,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:18,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:35:18,240 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1572407842, now seen corresponding path program 1 times [2022-11-02 20:35:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:18,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078130560] [2022-11-02 20:35:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:35:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078130560] [2022-11-02 20:35:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078130560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:19,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:19,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043906802] [2022-11-02 20:35:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:19,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:19,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:19,445 INFO L87 Difference]: Start difference. First operand 147227 states and 175574 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:21,407 INFO L93 Difference]: Finished difference Result 424126 states and 506087 transitions. [2022-11-02 20:35:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-11-02 20:35:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:21,701 INFO L225 Difference]: With dead ends: 424126 [2022-11-02 20:35:21,701 INFO L226 Difference]: Without dead ends: 277022 [2022-11-02 20:35:21,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:21,754 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 513 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:21,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 916 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:35:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277022 states.