./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/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_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/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_9c3dd951-7bb0-472c-848e-949629f24d30/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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- 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:13:56,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:13:56,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:13:57,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:13:57,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:13:57,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:13:57,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:13:57,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:13:57,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:13:57,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:13:57,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:13:57,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:13:57,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:13:57,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:13:57,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:13:57,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:13:57,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:13:57,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:13:57,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:13:57,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:13:57,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:13:57,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:13:57,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:13:57,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:13:57,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:13:57,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:13:57,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:13:57,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:13:57,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:13:57,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:13:57,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:13:57,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:13:57,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:13:57,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:13:57,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:13:57,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:13:57,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:13:57,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:13:57,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:13:57,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:13:57,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:13:57,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:13:57,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:13:57,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:13:57,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:13:57,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:13:57,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:13:57,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:13:57,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:13:57,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:13:57,172 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:13:57,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:13:57,174 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:13:57,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:13:57,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:13:57,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:13:57,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:13:57,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:13:57,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:13:57,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:13:57,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:13:57,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:13:57,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:13:57,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:13:57,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:13:57,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:13:57,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:13:57,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:13:57,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:13:57,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:13:57,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:13:57,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:13:57,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:13:57,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:13:57,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:13:57,180 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_9c3dd951-7bb0-472c-848e-949629f24d30/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_9c3dd951-7bb0-472c-848e-949629f24d30/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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-11-02 20:13:57,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:13:57,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:13:57,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:13:57,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:13:57,463 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:13:57,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_12.c [2022-11-02 20:13:57,556 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/data/c84ac9734/e8e52f9d736b4c7c9d38ec513d8e12eb/FLAG5e050e643 [2022-11-02 20:13:58,133 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:13:58,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/sv-benchmarks/c/locks/test_locks_12.c [2022-11-02 20:13:58,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/data/c84ac9734/e8e52f9d736b4c7c9d38ec513d8e12eb/FLAG5e050e643 [2022-11-02 20:13:58,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/data/c84ac9734/e8e52f9d736b4c7c9d38ec513d8e12eb [2022-11-02 20:13:58,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:13:58,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:13:58,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:13:58,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:13:58,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:13:58,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc6ceda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58, skipping insertion in model container [2022-11-02 20:13:58,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:13:58,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:13:58,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-11-02 20:13:58,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:13:58,745 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:13:58,773 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_9c3dd951-7bb0-472c-848e-949629f24d30/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-11-02 20:13:58,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:13:58,788 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:13:58,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58 WrapperNode [2022-11-02 20:13:58,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:13:58,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:13:58,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:13:58,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:13:58,798 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:13:58" (1/1) ... [2022-11-02 20:13:58,817 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:13:58" (1/1) ... [2022-11-02 20:13:58,839 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2022-11-02 20:13:58,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:13:58,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:13:58,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:13:58,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:13:58,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,863 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:13:58,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:13:58,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:13:58,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:13:58,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (1/1) ... [2022-11-02 20:13:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:13:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:13:58,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:13:58,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:13:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:13:59,039 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:13:59,041 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:13:59,292 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:13:59,299 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:13:59,300 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:13:59,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:59 BoogieIcfgContainer [2022-11-02 20:13:59,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:13:59,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:13:59,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:13:59,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:13:59,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:13:58" (1/3) ... [2022-11-02 20:13:59,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4724efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:13:59, skipping insertion in model container [2022-11-02 20:13:59,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:58" (2/3) ... [2022-11-02 20:13:59,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4724efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:13:59, skipping insertion in model container [2022-11-02 20:13:59,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:59" (3/3) ... [2022-11-02 20:13:59,329 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-11-02 20:13:59,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:13:59,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:13:59,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:13:59,421 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;@546683df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:13:59,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:13:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:13:59,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:13:59,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:13:59,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:13:59,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2022-11-02 20:13:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:59,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000426726] [2022-11-02 20:13:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:59,714 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:13:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000426726] [2022-11-02 20:13:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000426726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:13:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094384043] [2022-11-02 20:13:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:13:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:13:59,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:13:59,776 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:13:59,886 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2022-11-02 20:13:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:13:59,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:13:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:13:59,902 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:13:59,902 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:13:59,905 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:13:59,908 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:13:59,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:13:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:13:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-11-02 20:13:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-11-02 20:13:59,987 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2022-11-02 20:13:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:13:59,988 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2022-11-02 20:13:59,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2022-11-02 20:13:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:13:59,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:13:59,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:13:59,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:13:59,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:13:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2022-11-02 20:13:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:59,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391001922] [2022-11-02 20:13:59,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,128 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:14:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391001922] [2022-11-02 20:14:00,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391001922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124177270] [2022-11-02 20:14:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,133 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,178 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2022-11-02 20:14:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:14:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,183 INFO L225 Difference]: With dead ends: 134 [2022-11-02 20:14:00,183 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:14:00,183 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:14:00,185 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:14:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-11-02 20:14:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2022-11-02 20:14:00,201 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2022-11-02 20:14:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,204 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2022-11-02 20:14:00,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2022-11-02 20:14:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:14:00,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,209 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] [2022-11-02 20:14:00,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:14:00,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2022-11-02 20:14:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955039873] [2022-11-02 20:14:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,327 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:14:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955039873] [2022-11-02 20:14:00,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955039873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721092722] [2022-11-02 20:14:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,334 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,369 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2022-11-02 20:14:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:14:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,375 INFO L225 Difference]: With dead ends: 123 [2022-11-02 20:14:00,375 INFO L226 Difference]: Without dead ends: 84 [2022-11-02 20:14:00,376 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:14:00,380 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-02 20:14:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-11-02 20:14:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2022-11-02 20:14:00,392 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2022-11-02 20:14:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,393 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2022-11-02 20:14:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2022-11-02 20:14:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:14:00,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,394 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] [2022-11-02 20:14:00,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:14:00,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2022-11-02 20:14:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292793286] [2022-11-02 20:14:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,479 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:14:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292793286] [2022-11-02 20:14:00,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292793286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943376961] [2022-11-02 20:14:00,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,485 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,514 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2022-11-02 20:14:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:14:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,516 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:14:00,516 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:14:00,519 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:14:00,526 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:14:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-11-02 20:14:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2022-11-02 20:14:00,540 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2022-11-02 20:14:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,540 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2022-11-02 20:14:00,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2022-11-02 20:14:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:14:00,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,549 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] [2022-11-02 20:14:00,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:14:00,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2022-11-02 20:14:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962531636] [2022-11-02 20:14:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,634 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:14:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962531636] [2022-11-02 20:14:00,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962531636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062760836] [2022-11-02 20:14:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,637 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,652 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2022-11-02 20:14:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:14:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,654 INFO L225 Difference]: With dead ends: 261 [2022-11-02 20:14:00,654 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:14:00,655 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:14:00,656 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:14:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2022-11-02 20:14:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2022-11-02 20:14:00,669 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2022-11-02 20:14:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,669 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2022-11-02 20:14:00,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2022-11-02 20:14:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:14:00,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,671 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:14:00,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:14:00,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2022-11-02 20:14:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940934138] [2022-11-02 20:14:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,730 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:14:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940934138] [2022-11-02 20:14:00,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940934138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677901734] [2022-11-02 20:14:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,742 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,764 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2022-11-02 20:14:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:14:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,766 INFO L225 Difference]: With dead ends: 234 [2022-11-02 20:14:00,767 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:14:00,770 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:14:00,774 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:14:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-11-02 20:14:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2022-11-02 20:14:00,797 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2022-11-02 20:14:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,797 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2022-11-02 20:14:00,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2022-11-02 20:14:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:14:00,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,799 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:14:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:14:00,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2022-11-02 20:14:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334990557] [2022-11-02 20:14:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,866 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:14:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334990557] [2022-11-02 20:14:00,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334990557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670832048] [2022-11-02 20:14:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,869 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,896 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2022-11-02 20:14:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:14:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,899 INFO L225 Difference]: With dead ends: 453 [2022-11-02 20:14:00,899 INFO L226 Difference]: Without dead ends: 303 [2022-11-02 20:14:00,901 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:14:00,902 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-02 20:14:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-11-02 20:14:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2022-11-02 20:14:00,919 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2022-11-02 20:14:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,919 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2022-11-02 20:14:00,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2022-11-02 20:14:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:14:00,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,921 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:14:00,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:14:00,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2022-11-02 20:14:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737019000] [2022-11-02 20:14:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:00,954 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:14:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737019000] [2022-11-02 20:14:00,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737019000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:00,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:00,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827537253] [2022-11-02 20:14:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:00,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:00,956 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:00,970 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2022-11-02 20:14:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:14:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:00,972 INFO L225 Difference]: With dead ends: 385 [2022-11-02 20:14:00,972 INFO L226 Difference]: Without dead ends: 383 [2022-11-02 20:14:00,973 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:14:00,973 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:00,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-02 20:14:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2022-11-02 20:14:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2022-11-02 20:14:00,986 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2022-11-02 20:14:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:00,986 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2022-11-02 20:14:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2022-11-02 20:14:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:14:00,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:00,988 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] [2022-11-02 20:14:00,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:14:00,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2022-11-02 20:14:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:00,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326581539] [2022-11-02 20:14:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,019 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:14:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326581539] [2022-11-02 20:14:01,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326581539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111891695] [2022-11-02 20:14:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,022 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,038 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2022-11-02 20:14:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:14:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,041 INFO L225 Difference]: With dead ends: 565 [2022-11-02 20:14:01,042 INFO L226 Difference]: Without dead ends: 563 [2022-11-02 20:14:01,042 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:14:01,043 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-02 20:14:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2022-11-02 20:14:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2022-11-02 20:14:01,058 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2022-11-02 20:14:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,058 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2022-11-02 20:14:01,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2022-11-02 20:14:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:14:01,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,060 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] [2022-11-02 20:14:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:14:01,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2022-11-02 20:14:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839429809] [2022-11-02 20:14:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,088 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:14:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839429809] [2022-11-02 20:14:01,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839429809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807473651] [2022-11-02 20:14:01,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,091 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,111 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2022-11-02 20:14:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:14:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,115 INFO L225 Difference]: With dead ends: 997 [2022-11-02 20:14:01,115 INFO L226 Difference]: Without dead ends: 587 [2022-11-02 20:14:01,115 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:14:01,116 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-02 20:14:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-11-02 20:14:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2022-11-02 20:14:01,158 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2022-11-02 20:14:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,158 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2022-11-02 20:14:01,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2022-11-02 20:14:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:14:01,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,160 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] [2022-11-02 20:14:01,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:14:01,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2022-11-02 20:14:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045613948] [2022-11-02 20:14:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,193 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:14:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045613948] [2022-11-02 20:14:01,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045613948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282602098] [2022-11-02 20:14:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,196 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,219 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2022-11-02 20:14:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,219 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:14:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,222 INFO L225 Difference]: With dead ends: 885 [2022-11-02 20:14:01,222 INFO L226 Difference]: Without dead ends: 599 [2022-11-02 20:14:01,223 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:14:01,224 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-02 20:14:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-11-02 20:14:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2022-11-02 20:14:01,250 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2022-11-02 20:14:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,251 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2022-11-02 20:14:01,251 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2022-11-02 20:14:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:14:01,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,259 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] [2022-11-02 20:14:01,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:14:01,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2022-11-02 20:14:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256960671] [2022-11-02 20:14:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,332 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:14:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256960671] [2022-11-02 20:14:01,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256960671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047571965] [2022-11-02 20:14:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,335 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,373 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2022-11-02 20:14:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,373 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:14:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,378 INFO L225 Difference]: With dead ends: 1097 [2022-11-02 20:14:01,378 INFO L226 Difference]: Without dead ends: 1095 [2022-11-02 20:14:01,379 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:14:01,380 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-11-02 20:14:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2022-11-02 20:14:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2022-11-02 20:14:01,410 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2022-11-02 20:14:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,410 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2022-11-02 20:14:01,411 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2022-11-02 20:14:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:14:01,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,414 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] [2022-11-02 20:14:01,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:14:01,414 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2022-11-02 20:14:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693085199] [2022-11-02 20:14:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,461 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:14:01,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693085199] [2022-11-02 20:14:01,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693085199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311375438] [2022-11-02 20:14:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,464 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,495 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2022-11-02 20:14:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,496 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:14:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,501 INFO L225 Difference]: With dead ends: 1977 [2022-11-02 20:14:01,501 INFO L226 Difference]: Without dead ends: 1159 [2022-11-02 20:14:01,502 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:14:01,504 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-02 20:14:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2022-11-02 20:14:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2022-11-02 20:14:01,560 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2022-11-02 20:14:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,561 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2022-11-02 20:14:01,561 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2022-11-02 20:14:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:14:01,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,563 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:14:01,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:14:01,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2022-11-02 20:14:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739263250] [2022-11-02 20:14:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,591 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:14:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739263250] [2022-11-02 20:14:01,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739263250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806871857] [2022-11-02 20:14:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,593 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,622 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2022-11-02 20:14:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,622 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:14:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,626 INFO L225 Difference]: With dead ends: 1737 [2022-11-02 20:14:01,626 INFO L226 Difference]: Without dead ends: 1175 [2022-11-02 20:14:01,627 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:14:01,628 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-11-02 20:14:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2022-11-02 20:14:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2022-11-02 20:14:01,665 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2022-11-02 20:14:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,666 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2022-11-02 20:14:01,666 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2022-11-02 20:14:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:14:01,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,668 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:14:01,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:14:01,668 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2022-11-02 20:14:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486966149] [2022-11-02 20:14:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,702 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:14:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486966149] [2022-11-02 20:14:01,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486966149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587747] [2022-11-02 20:14:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,705 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,745 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2022-11-02 20:14:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,745 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:14:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,752 INFO L225 Difference]: With dead ends: 2121 [2022-11-02 20:14:01,753 INFO L226 Difference]: Without dead ends: 2119 [2022-11-02 20:14:01,755 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:14:01,756 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-11-02 20:14:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2022-11-02 20:14:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2022-11-02 20:14:01,816 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2022-11-02 20:14:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2022-11-02 20:14:01,817 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2022-11-02 20:14:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:14:01,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:01,819 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:14:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:14:01,820 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2022-11-02 20:14:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:01,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890799676] [2022-11-02 20:14:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:01,857 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:14:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890799676] [2022-11-02 20:14:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890799676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:01,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:01,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440021563] [2022-11-02 20:14:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:01,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:01,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:01,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:01,859 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:01,933 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2022-11-02 20:14:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:01,934 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:14:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:01,941 INFO L225 Difference]: With dead ends: 3913 [2022-11-02 20:14:01,941 INFO L226 Difference]: Without dead ends: 2279 [2022-11-02 20:14:01,945 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:14:01,946 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:01,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-11-02 20:14:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2022-11-02 20:14:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2022-11-02 20:14:02,030 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2022-11-02 20:14:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:02,030 INFO L495 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2022-11-02 20:14:02,030 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2022-11-02 20:14:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:14:02,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:02,033 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:14:02,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:14:02,034 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2022-11-02 20:14:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:02,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737636034] [2022-11-02 20:14:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:02,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737636034] [2022-11-02 20:14:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737636034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:02,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128968359] [2022-11-02 20:14:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:02,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:02,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:02,068 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:02,122 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2022-11-02 20:14:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:02,122 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:14:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:02,129 INFO L225 Difference]: With dead ends: 3417 [2022-11-02 20:14:02,130 INFO L226 Difference]: Without dead ends: 2311 [2022-11-02 20:14:02,131 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:14:02,133 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:02,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-11-02 20:14:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2022-11-02 20:14:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2022-11-02 20:14:02,228 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2022-11-02 20:14:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:02,228 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2022-11-02 20:14:02,228 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2022-11-02 20:14:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:14:02,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:02,231 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:14:02,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:14:02,232 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2022-11-02 20:14:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596882955] [2022-11-02 20:14:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,264 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:14:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:02,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596882955] [2022-11-02 20:14:02,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596882955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:02,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:02,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073751200] [2022-11-02 20:14:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:02,267 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:02,358 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2022-11-02 20:14:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:02,359 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:14:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:02,372 INFO L225 Difference]: With dead ends: 4105 [2022-11-02 20:14:02,372 INFO L226 Difference]: Without dead ends: 4103 [2022-11-02 20:14:02,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:02,374 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:02,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-11-02 20:14:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2022-11-02 20:14:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2022-11-02 20:14:02,488 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2022-11-02 20:14:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:02,489 INFO L495 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2022-11-02 20:14:02,489 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2022-11-02 20:14:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:14:02,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:02,493 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:14:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:14:02,494 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2022-11-02 20:14:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:02,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994378033] [2022-11-02 20:14:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,525 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:14:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994378033] [2022-11-02 20:14:02,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994378033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:02,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:02,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234556622] [2022-11-02 20:14:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:02,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:02,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:02,529 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:02,678 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2022-11-02 20:14:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:02,679 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:14:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:02,693 INFO L225 Difference]: With dead ends: 7753 [2022-11-02 20:14:02,694 INFO L226 Difference]: Without dead ends: 4487 [2022-11-02 20:14:02,697 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:14:02,698 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:02,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-11-02 20:14:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2022-11-02 20:14:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2022-11-02 20:14:02,863 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2022-11-02 20:14:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:02,864 INFO L495 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2022-11-02 20:14:02,865 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2022-11-02 20:14:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:14:02,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:02,869 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:14:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:14:02,870 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2022-11-02 20:14:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:02,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238431740] [2022-11-02 20:14:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:02,901 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:14:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:02,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238431740] [2022-11-02 20:14:02,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238431740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:02,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:02,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949286283] [2022-11-02 20:14:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:02,903 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:03,017 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2022-11-02 20:14:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:14:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:03,043 INFO L225 Difference]: With dead ends: 6729 [2022-11-02 20:14:03,050 INFO L226 Difference]: Without dead ends: 4551 [2022-11-02 20:14:03,053 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:14:03,054 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:03,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2022-11-02 20:14:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2022-11-02 20:14:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2022-11-02 20:14:03,217 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2022-11-02 20:14:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:03,217 INFO L495 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2022-11-02 20:14:03,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2022-11-02 20:14:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:14:03,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:03,224 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:14:03,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:14:03,225 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2022-11-02 20:14:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:03,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393663093] [2022-11-02 20:14:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:03,249 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:14:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:03,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393663093] [2022-11-02 20:14:03,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393663093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:03,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:03,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072007829] [2022-11-02 20:14:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:03,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:03,253 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:03,388 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2022-11-02 20:14:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:14:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:03,404 INFO L225 Difference]: With dead ends: 7945 [2022-11-02 20:14:03,404 INFO L226 Difference]: Without dead ends: 7943 [2022-11-02 20:14:03,406 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:14:03,408 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:03,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2022-11-02 20:14:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2022-11-02 20:14:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2022-11-02 20:14:03,644 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2022-11-02 20:14:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:03,644 INFO L495 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2022-11-02 20:14:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2022-11-02 20:14:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:14:03,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:03,653 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:14:03,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:14:03,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2022-11-02 20:14:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:03,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585097150] [2022-11-02 20:14:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:03,679 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:14:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585097150] [2022-11-02 20:14:03,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585097150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:03,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:03,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059132031] [2022-11-02 20:14:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:03,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:03,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:03,682 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:03,842 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2022-11-02 20:14:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:03,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:14:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:03,861 INFO L225 Difference]: With dead ends: 15369 [2022-11-02 20:14:03,861 INFO L226 Difference]: Without dead ends: 8839 [2022-11-02 20:14:03,870 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:14:03,871 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:03,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-11-02 20:14:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2022-11-02 20:14:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2022-11-02 20:14:04,239 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2022-11-02 20:14:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:04,240 INFO L495 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2022-11-02 20:14:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2022-11-02 20:14:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:14:04,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:04,249 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] [2022-11-02 20:14:04,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:14:04,249 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2022-11-02 20:14:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:04,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339718836] [2022-11-02 20:14:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:04,306 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:14:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339718836] [2022-11-02 20:14:04,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339718836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:04,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417401916] [2022-11-02 20:14:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:04,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:04,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:04,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:04,308 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:04,448 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2022-11-02 20:14:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:14:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:04,467 INFO L225 Difference]: With dead ends: 13257 [2022-11-02 20:14:04,467 INFO L226 Difference]: Without dead ends: 8967 [2022-11-02 20:14:04,474 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:14:04,475 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:04,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2022-11-02 20:14:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2022-11-02 20:14:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2022-11-02 20:14:04,756 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2022-11-02 20:14:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:04,757 INFO L495 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2022-11-02 20:14:04,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2022-11-02 20:14:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:14:04,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:04,765 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] [2022-11-02 20:14:04,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:14:04,765 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2022-11-02 20:14:04,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:04,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154651226] [2022-11-02 20:14:04,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:04,796 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:14:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154651226] [2022-11-02 20:14:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154651226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:04,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:04,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607858949] [2022-11-02 20:14:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:04,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:04,802 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:05,056 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2022-11-02 20:14:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:14:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:05,085 INFO L225 Difference]: With dead ends: 15369 [2022-11-02 20:14:05,086 INFO L226 Difference]: Without dead ends: 15367 [2022-11-02 20:14:05,089 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:14:05,090 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:05,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2022-11-02 20:14:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2022-11-02 20:14:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13317 states, 13316 states have (on average 1.3555872634424753) internal successors, (18051), 13316 states have internal predecessors, (18051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2022-11-02 20:14:05,561 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2022-11-02 20:14:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:05,561 INFO L495 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2022-11-02 20:14:05,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2022-11-02 20:14:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:14:05,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:05,581 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] [2022-11-02 20:14:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:14:05,581 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2022-11-02 20:14:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:05,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783449289] [2022-11-02 20:14:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:05,611 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:14:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783449289] [2022-11-02 20:14:05,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783449289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:05,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:05,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575522885] [2022-11-02 20:14:05,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:05,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:05,614 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:06,094 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2022-11-02 20:14:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:14:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:06,128 INFO L225 Difference]: With dead ends: 30473 [2022-11-02 20:14:06,129 INFO L226 Difference]: Without dead ends: 17415 [2022-11-02 20:14:06,141 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:14:06,142 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:06,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2022-11-02 20:14:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2022-11-02 20:14:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3381001608086378) internal successors, (23299), 17412 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2022-11-02 20:14:06,708 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2022-11-02 20:14:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:06,708 INFO L495 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2022-11-02 20:14:06,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2022-11-02 20:14:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:14:06,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:06,725 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:14:06,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:14:06,725 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2022-11-02 20:14:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115524566] [2022-11-02 20:14:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:06,754 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:14:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:06,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115524566] [2022-11-02 20:14:06,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115524566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:06,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:06,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861374971] [2022-11-02 20:14:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:06,758 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:07,033 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2022-11-02 20:14:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:07,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:14:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:07,071 INFO L225 Difference]: With dead ends: 26121 [2022-11-02 20:14:07,071 INFO L226 Difference]: Without dead ends: 17671 [2022-11-02 20:14:07,083 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:14:07,084 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:07,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2022-11-02 20:14:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2022-11-02 20:14:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.318711795336201) internal successors, (23299), 17668 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2022-11-02 20:14:07,612 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2022-11-02 20:14:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:07,612 INFO L495 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2022-11-02 20:14:07,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2022-11-02 20:14:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:14:07,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:07,700 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:14:07,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:14:07,700 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:07,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2022-11-02 20:14:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:07,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175960607] [2022-11-02 20:14:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:07,741 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:14:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:07,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175960607] [2022-11-02 20:14:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175960607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:07,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934947894] [2022-11-02 20:14:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:07,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:07,744 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:08,383 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2022-11-02 20:14:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:14:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:08,439 INFO L225 Difference]: With dead ends: 29705 [2022-11-02 20:14:08,439 INFO L226 Difference]: Without dead ends: 29703 [2022-11-02 20:14:08,448 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:14:08,450 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:08,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2022-11-02 20:14:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2022-11-02 20:14:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2787667117320114) internal successors, (34051), 26628 states have internal predecessors, (34051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2022-11-02 20:14:09,168 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2022-11-02 20:14:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:09,169 INFO L495 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2022-11-02 20:14:09,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2022-11-02 20:14:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:14:09,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:09,206 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:14:09,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:14:09,207 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2022-11-02 20:14:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904211180] [2022-11-02 20:14:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:09,236 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:14:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:09,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904211180] [2022-11-02 20:14:09,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904211180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:09,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:09,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432046433] [2022-11-02 20:14:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:09,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:09,241 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:10,049 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2022-11-02 20:14:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:14:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:10,095 INFO L225 Difference]: With dead ends: 60425 [2022-11-02 20:14:10,095 INFO L226 Difference]: Without dead ends: 34311 [2022-11-02 20:14:10,118 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:14:10,119 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:10,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2022-11-02 20:14:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2022-11-02 20:14:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2536726128016789) internal successors, (43011), 34308 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2022-11-02 20:14:11,014 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2022-11-02 20:14:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:11,015 INFO L495 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2022-11-02 20:14:11,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2022-11-02 20:14:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:14:11,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:11,040 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] [2022-11-02 20:14:11,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:14:11,040 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:11,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2022-11-02 20:14:11,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:11,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536954452] [2022-11-02 20:14:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536954452] [2022-11-02 20:14:11,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536954452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:11,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:11,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268994965] [2022-11-02 20:14:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:11,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:11,068 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:11,849 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2022-11-02 20:14:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:14:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:11,904 INFO L225 Difference]: With dead ends: 51465 [2022-11-02 20:14:11,904 INFO L226 Difference]: Without dead ends: 34823 [2022-11-02 20:14:11,921 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:14:11,922 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:11,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2022-11-02 20:14:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2022-11-02 20:14:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.23523836875359) internal successors, (43011), 34820 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2022-11-02 20:14:12,926 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2022-11-02 20:14:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:12,926 INFO L495 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2022-11-02 20:14:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2022-11-02 20:14:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:14:12,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:12,950 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] [2022-11-02 20:14:12,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:14:12,951 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2022-11-02 20:14:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533609733] [2022-11-02 20:14:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:12,972 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:14:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:12,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533609733] [2022-11-02 20:14:12,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533609733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:12,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:12,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769444376] [2022-11-02 20:14:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:12,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:12,975 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:14,071 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2022-11-02 20:14:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:14:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:14,180 INFO L225 Difference]: With dead ends: 101385 [2022-11-02 20:14:14,180 INFO L226 Difference]: Without dead ends: 67591 [2022-11-02 20:14:14,207 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:14:14,209 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:14,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2022-11-02 20:14:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2022-11-02 20:14:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1817926259099247) internal successors, (79875), 67588 states have internal predecessors, (79875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2022-11-02 20:14:15,851 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2022-11-02 20:14:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:15,852 INFO L495 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2022-11-02 20:14:15,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2022-11-02 20:14:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:14:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:15,913 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] [2022-11-02 20:14:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:14:15,913 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2022-11-02 20:14:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148828440] [2022-11-02 20:14:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:15,939 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:14:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:15,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148828440] [2022-11-02 20:14:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148828440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:15,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118233871] [2022-11-02 20:14:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:15,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:15,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:15,944 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:17,098 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2022-11-02 20:14:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:14:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:17,165 INFO L225 Difference]: With dead ends: 71689 [2022-11-02 20:14:17,165 INFO L226 Difference]: Without dead ends: 71687 [2022-11-02 20:14:17,175 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:14:17,175 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:17,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2022-11-02 20:14:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2022-11-02 20:14:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.166642007456945) internal successors, (78851), 67588 states have internal predecessors, (78851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2022-11-02 20:14:18,792 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2022-11-02 20:14:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:18,792 INFO L495 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2022-11-02 20:14:18,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2022-11-02 20:14:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:14:19,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:19,062 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] [2022-11-02 20:14:19,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:14:19,062 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2022-11-02 20:14:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:19,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315235362] [2022-11-02 20:14:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:19,087 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:14:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:19,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315235362] [2022-11-02 20:14:19,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315235362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:19,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:19,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919029315] [2022-11-02 20:14:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:19,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:19,091 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:20,449 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2022-11-02 20:14:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:14:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:20,601 INFO L225 Difference]: With dead ends: 109575 [2022-11-02 20:14:20,601 INFO L226 Difference]: Without dead ends: 109573 [2022-11-02 20:14:20,623 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:14:20,628 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:20,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2022-11-02 20:14:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2022-11-02 20:14:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105477 states, 105476 states have (on average 1.1456160643179492) internal successors, (120835), 105476 states have internal predecessors, (120835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2022-11-02 20:14:22,944 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2022-11-02 20:14:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:22,944 INFO L495 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2022-11-02 20:14:22,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2022-11-02 20:14:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:14:23,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:14:23,007 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] [2022-11-02 20:14:23,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:14:23,007 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:14:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2022-11-02 20:14:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:23,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052228527] [2022-11-02 20:14:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,039 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:14:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052228527] [2022-11-02 20:14:23,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052228527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998252022] [2022-11-02 20:14:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:23,042 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:14:25,409 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2022-11-02 20:14:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:14:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:14:25,411 INFO L225 Difference]: With dead ends: 236549 [2022-11-02 20:14:25,411 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:14:25,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:14:25,515 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:14:25,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:14:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:14:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:14:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:14:25,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-11-02 20:14:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:14:25,517 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:14:25,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:14:25,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:14:25,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:14:25,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:14:25,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:14:25,545 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-11-02 20:14:25,546 INFO L895 garLoopResultBuilder]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2022-11-02 20:14:25,546 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,546 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,546 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-11-02 20:14:25,547 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,548 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,548 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-11-02 20:14:25,548 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,548 INFO L902 garLoopResultBuilder]: At program point L189(lines 7 193) the Hoare annotation is: true [2022-11-02 20:14:25,548 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,549 INFO L899 garLoopResultBuilder]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:14:25,549 INFO L899 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2022-11-02 20:14:25,549 INFO L899 garLoopResultBuilder]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,550 INFO L902 garLoopResultBuilder]: At program point L192(lines 6 193) the Hoare annotation is: true [2022-11-02 20:14:25,550 INFO L899 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2022-11-02 20:14:25,550 INFO L899 garLoopResultBuilder]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,550 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,550 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,552 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:14:25,552 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-11-02 20:14:25,552 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-11-02 20:14:25,552 INFO L899 garLoopResultBuilder]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,553 INFO L899 garLoopResultBuilder]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,554 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,554 INFO L899 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2022-11-02 20:14:25,554 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-02 20:14:25,554 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,554 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,555 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-11-02 20:14:25,555 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,555 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:14:25,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2022-11-02 20:14:25,555 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,556 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-02 20:14:25,556 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,556 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-11-02 20:14:25,556 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2022-11-02 20:14:25,556 INFO L902 garLoopResultBuilder]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2022-11-02 20:14:25,557 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-11-02 20:14:25,562 INFO L444 BasicCegarLoop]: Path program 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:14:25,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:14:25,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:14:25 BoogieIcfgContainer [2022-11-02 20:14:25,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:14:25,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:14:25,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:14:25,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:14:25,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:59" (3/4) ... [2022-11-02 20:14:25,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:14:25,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:14:25,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:14:25,612 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:14:25,612 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:14:25,675 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:14:25,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:14:25,676 INFO L158 Benchmark]: Toolchain (without parser) took 27180.64ms. Allocated memory was 127.9MB in the beginning and 12.9GB in the end (delta: 12.8GB). Free memory was 93.9MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-02 20:14:25,676 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:25,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.86ms. Allocated memory is still 127.9MB. Free memory was 93.6MB in the beginning and 102.1MB in the end (delta: -8.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-11-02 20:14:25,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.39ms. Allocated memory is still 127.9MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:14:25,685 INFO L158 Benchmark]: Boogie Preprocessor took 26.50ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 98.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:25,686 INFO L158 Benchmark]: RCFGBuilder took 436.86ms. Allocated memory is still 127.9MB. Free memory was 98.6MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:14:25,688 INFO L158 Benchmark]: TraceAbstraction took 26282.55ms. Allocated memory was 127.9MB in the beginning and 12.9GB in the end (delta: 12.8GB). Free memory was 82.8MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-02 20:14:25,689 INFO L158 Benchmark]: Witness Printer took 84.60ms. Allocated memory is still 12.9GB. Free memory was 11.2GB in the beginning and 11.2GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:14:25,691 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.86ms. Allocated memory is still 127.9MB. Free memory was 93.6MB in the beginning and 102.1MB in the end (delta: -8.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.39ms. Allocated memory is still 127.9MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.50ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 98.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 436.86ms. Allocated memory is still 127.9MB. Free memory was 98.6MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26282.55ms. Allocated memory was 127.9MB in the beginning and 12.9GB in the end (delta: 12.8GB). Free memory was 82.8MB in the beginning and 11.2GB in the end (delta: -11.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 84.60ms. Allocated memory is still 12.9GB. Free memory was 11.2GB in the beginning and 11.2GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1629 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1629 mSDsluCounter, 5405 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2174 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3231 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 1702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:14:25,937 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-02 20:14:25,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c3dd951-7bb0-472c-848e-949629f24d30/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE