./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/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 6fed4ea6707efb0c46113b7defb1e72bb9bbe71f593886f20a58e457577f3a05 --- 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:15:36,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:15:36,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:15:36,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:15:36,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:15:36,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:15:36,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:15:36,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:15:36,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:15:36,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:15:36,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:15:36,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:15:36,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:15:36,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:15:36,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:15:36,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:15:36,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:15:36,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:15:36,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:15:36,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:15:36,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:15:36,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:15:36,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:15:36,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:15:36,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:15:36,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:15:36,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:15:36,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:15:36,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:15:36,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:15:36,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:15:36,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:15:36,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:15:36,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:15:36,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:15:36,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:15:36,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:15:36,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:15:36,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:15:36,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:15:36,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:15:36,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:15:36,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:15:36,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:15:36,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:15:36,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:15:36,259 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:15:36,259 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:15:36,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:15:36,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:15:36,261 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:15:36,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:15:36,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:15:36,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:15:36,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:15:36,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:15:36,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:15:36,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:15:36,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:15:36,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:15:36,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:15:36,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:15:36,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:15:36,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:15:36,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:15:36,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:15:36,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:15:36,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:15:36,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:15:36,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:15:36,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:15:36,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:15:36,265 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:15:36,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:15:36,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:15:36,266 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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/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 -> 6fed4ea6707efb0c46113b7defb1e72bb9bbe71f593886f20a58e457577f3a05 [2022-11-02 20:15:36,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:15:36,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:15:36,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:15:36,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:15:36,591 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:15:36,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c [2022-11-02 20:15:36,676 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/data/cde275fb3/2ba65b0ae05149029a99eb7c0ae538ab/FLAGfac5f1b92 [2022-11-02 20:15:37,380 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:15:37,381 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c [2022-11-02 20:15:37,410 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/data/cde275fb3/2ba65b0ae05149029a99eb7c0ae538ab/FLAGfac5f1b92 [2022-11-02 20:15:37,555 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/data/cde275fb3/2ba65b0ae05149029a99eb7c0ae538ab [2022-11-02 20:15:37,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:15:37,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:15:37,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:15:37,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:15:37,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:15:37,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:15:37" (1/1) ... [2022-11-02 20:15:37,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519c4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:37, skipping insertion in model container [2022-11-02 20:15:37,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:15:37" (1/1) ... [2022-11-02 20:15:37,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:15:37,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:15:38,249 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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c[75166,75179] [2022-11-02 20:15:38,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:15:38,284 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:15:38,419 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_c9619a9d-154a-4a88-8058-7f76e4ca18ea/sv-benchmarks/c/openssl/s3_srvr.blast.12.i.cil-1.c[75166,75179] [2022-11-02 20:15:38,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:15:38,443 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:15:38,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38 WrapperNode [2022-11-02 20:15:38,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:15:38,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:15:38,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:15:38,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:15:38,455 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:15:38" (1/1) ... [2022-11-02 20:15:38,479 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:15:38" (1/1) ... [2022-11-02 20:15:38,568 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 797 [2022-11-02 20:15:38,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:15:38,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:15:38,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:15:38,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:15:38,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,657 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:15:38,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:15:38,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:15:38,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:15:38,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (1/1) ... [2022-11-02 20:15:38,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:15:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:15:38,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:15:38,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:15:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:15:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:15:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:15:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:15:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:15:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:15:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:15:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:15:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:15:39,113 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:15:39,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:15:39,139 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:15:42,392 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 20:15:42,392 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 20:15:42,393 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:15:42,402 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:15:42,405 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:15:42,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:15:42 BoogieIcfgContainer [2022-11-02 20:15:42,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:15:42,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:15:42,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:15:42,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:15:42,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:15:37" (1/3) ... [2022-11-02 20:15:42,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c989052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:15:42, skipping insertion in model container [2022-11-02 20:15:42,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:15:38" (2/3) ... [2022-11-02 20:15:42,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c989052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:15:42, skipping insertion in model container [2022-11-02 20:15:42,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:15:42" (3/3) ... [2022-11-02 20:15:42,424 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2022-11-02 20:15:42,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:15:42,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:15:42,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:15:42,558 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;@76532f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:15:42,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:15:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 150 states have (on average 1.72) internal successors, (258), 151 states have internal predecessors, (258), 0 states have call successors, (0), 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:15:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:15:42,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:42,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:42,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:42,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1692197635, now seen corresponding path program 1 times [2022-11-02 20:15:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:42,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829233233] [2022-11-02 20:15:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:44,061 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:15:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829233233] [2022-11-02 20:15:44,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829233233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:44,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:44,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234765735] [2022-11-02 20:15:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:44,129 INFO L87 Difference]: Start difference. First operand has 152 states, 150 states have (on average 1.72) internal successors, (258), 151 states have internal predecessors, (258), 0 states have call successors, (0), 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 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:15:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:45,660 INFO L93 Difference]: Finished difference Result 428 states and 730 transitions. [2022-11-02 20:15:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-11-02 20:15:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:45,692 INFO L225 Difference]: With dead ends: 428 [2022-11-02 20:15:45,693 INFO L226 Difference]: Without dead ends: 261 [2022-11-02 20:15:45,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:45,704 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 162 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:45,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:15:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-02 20:15:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 179. [2022-11-02 20:15:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.6123595505617978) internal successors, (287), 178 states have internal predecessors, (287), 0 states have call successors, (0), 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:15:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 287 transitions. [2022-11-02 20:15:45,787 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 287 transitions. Word has length 43 [2022-11-02 20:15:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:45,788 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 287 transitions. [2022-11-02 20:15:45,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:15:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 287 transitions. [2022-11-02 20:15:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:15:45,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:45,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:15:45,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 910735618, now seen corresponding path program 1 times [2022-11-02 20:15:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:45,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472449113] [2022-11-02 20:15:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:46,483 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:15:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:46,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472449113] [2022-11-02 20:15:46,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472449113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:46,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:46,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030561258] [2022-11-02 20:15:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:46,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:46,494 INFO L87 Difference]: Start difference. First operand 179 states and 287 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:15:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:47,667 INFO L93 Difference]: Finished difference Result 376 states and 601 transitions. [2022-11-02 20:15:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-11-02 20:15:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:47,670 INFO L225 Difference]: With dead ends: 376 [2022-11-02 20:15:47,670 INFO L226 Difference]: Without dead ends: 207 [2022-11-02 20:15:47,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:47,672 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 22 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:47,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:15:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-02 20:15:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2022-11-02 20:15:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.619047619047619) internal successors, (306), 189 states have internal predecessors, (306), 0 states have call successors, (0), 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:15:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 306 transitions. [2022-11-02 20:15:47,690 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 306 transitions. Word has length 44 [2022-11-02 20:15:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:47,691 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 306 transitions. [2022-11-02 20:15:47,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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:15:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 306 transitions. [2022-11-02 20:15:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:15:47,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:47,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:47,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:15:47,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -574802552, now seen corresponding path program 1 times [2022-11-02 20:15:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954873631] [2022-11-02 20:15:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954873631] [2022-11-02 20:15:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954873631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:48,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:48,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264034811] [2022-11-02 20:15:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:48,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:48,297 INFO L87 Difference]: Start difference. First operand 190 states and 306 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:49,474 INFO L93 Difference]: Finished difference Result 519 states and 841 transitions. [2022-11-02 20:15:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-02 20:15:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:49,479 INFO L225 Difference]: With dead ends: 519 [2022-11-02 20:15:49,480 INFO L226 Difference]: Without dead ends: 350 [2022-11-02 20:15:49,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:49,482 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 151 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:49,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 642 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:15:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-02 20:15:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 222. [2022-11-02 20:15:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 221 states have internal predecessors, (357), 0 states have call successors, (0), 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:15:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 357 transitions. [2022-11-02 20:15:49,502 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 357 transitions. Word has length 57 [2022-11-02 20:15:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:49,503 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 357 transitions. [2022-11-02 20:15:49,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2022-11-02 20:15:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:15:49,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:49,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:49,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:15:49,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -800730793, now seen corresponding path program 1 times [2022-11-02 20:15:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:49,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127005019] [2022-11-02 20:15:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:50,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127005019] [2022-11-02 20:15:50,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127005019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:50,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:50,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807818858] [2022-11-02 20:15:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:50,159 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:51,261 INFO L93 Difference]: Finished difference Result 527 states and 844 transitions. [2022-11-02 20:15:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-02 20:15:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:51,264 INFO L225 Difference]: With dead ends: 527 [2022-11-02 20:15:51,264 INFO L226 Difference]: Without dead ends: 326 [2022-11-02 20:15:51,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:51,266 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 156 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:51,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:15:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-02 20:15:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 222. [2022-11-02 20:15:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.5972850678733033) internal successors, (353), 221 states have internal predecessors, (353), 0 states have call successors, (0), 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:15:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 353 transitions. [2022-11-02 20:15:51,289 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 353 transitions. Word has length 58 [2022-11-02 20:15:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:51,290 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 353 transitions. [2022-11-02 20:15:51,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 353 transitions. [2022-11-02 20:15:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:15:51,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:51,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:51,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:15:51,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1848241597, now seen corresponding path program 1 times [2022-11-02 20:15:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:51,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40389977] [2022-11-02 20:15:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40389977] [2022-11-02 20:15:51,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40389977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:51,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:51,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761244266] [2022-11-02 20:15:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:51,826 INFO L87 Difference]: Start difference. First operand 222 states and 353 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:52,627 INFO L93 Difference]: Finished difference Result 439 states and 695 transitions. [2022-11-02 20:15:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-02 20:15:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:52,630 INFO L225 Difference]: With dead ends: 439 [2022-11-02 20:15:52,630 INFO L226 Difference]: Without dead ends: 238 [2022-11-02 20:15:52,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:52,632 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:52,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 485 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:15:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-02 20:15:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 222. [2022-11-02 20:15:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.592760180995475) internal successors, (352), 221 states have internal predecessors, (352), 0 states have call successors, (0), 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:15:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 352 transitions. [2022-11-02 20:15:52,646 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 352 transitions. Word has length 58 [2022-11-02 20:15:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:52,646 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 352 transitions. [2022-11-02 20:15:52,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 352 transitions. [2022-11-02 20:15:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:15:52,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:52,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:52,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:15:52,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1310859404, now seen corresponding path program 1 times [2022-11-02 20:15:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:52,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905764250] [2022-11-02 20:15:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905764250] [2022-11-02 20:15:53,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905764250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:53,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:53,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111681111] [2022-11-02 20:15:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:53,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:53,091 INFO L87 Difference]: Start difference. First operand 222 states and 352 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:54,291 INFO L93 Difference]: Finished difference Result 438 states and 693 transitions. [2022-11-02 20:15:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-02 20:15:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:54,294 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:15:54,294 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 20:15:54,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:54,296 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 19 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:54,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 487 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:15:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 20:15:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 222. [2022-11-02 20:15:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.588235294117647) internal successors, (351), 221 states have internal predecessors, (351), 0 states have call successors, (0), 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:15:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 351 transitions. [2022-11-02 20:15:54,307 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 351 transitions. Word has length 58 [2022-11-02 20:15:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:54,307 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 351 transitions. [2022-11-02 20:15:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 351 transitions. [2022-11-02 20:15:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:15:54,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:54,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:54,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:15:54,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1663254580, now seen corresponding path program 1 times [2022-11-02 20:15:54,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:54,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189067900] [2022-11-02 20:15:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189067900] [2022-11-02 20:15:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189067900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:54,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:54,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579270860] [2022-11-02 20:15:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:54,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:54,766 INFO L87 Difference]: Start difference. First operand 222 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:56,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:15:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:56,815 INFO L93 Difference]: Finished difference Result 527 states and 835 transitions. [2022-11-02 20:15:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-02 20:15:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:56,818 INFO L225 Difference]: With dead ends: 527 [2022-11-02 20:15:56,818 INFO L226 Difference]: Without dead ends: 326 [2022-11-02 20:15:56,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:56,820 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 149 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:56,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 20:15:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-02 20:15:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 223. [2022-11-02 20:15:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.5765765765765767) internal successors, (350), 222 states have internal predecessors, (350), 0 states have call successors, (0), 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:15:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 350 transitions. [2022-11-02 20:15:56,832 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 350 transitions. Word has length 58 [2022-11-02 20:15:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:56,833 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 350 transitions. [2022-11-02 20:15:56,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 350 transitions. [2022-11-02 20:15:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:15:56,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:56,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:56,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:15:56,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1134870975, now seen corresponding path program 1 times [2022-11-02 20:15:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:56,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964037078] [2022-11-02 20:15:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964037078] [2022-11-02 20:15:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964037078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:57,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:57,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636078755] [2022-11-02 20:15:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:57,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:57,292 INFO L87 Difference]: Start difference. First operand 223 states and 350 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:15:58,575 INFO L93 Difference]: Finished difference Result 438 states and 689 transitions. [2022-11-02 20:15:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:15:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-02 20:15:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:15:58,578 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:15:58,578 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 20:15:58,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:15:58,579 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 22 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:15:58,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 491 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:15:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 20:15:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2022-11-02 20:15:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 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:15:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 349 transitions. [2022-11-02 20:15:58,590 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 349 transitions. Word has length 59 [2022-11-02 20:15:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:15:58,591 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 349 transitions. [2022-11-02 20:15:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 349 transitions. [2022-11-02 20:15:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:15:58,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:15:58,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:15:58,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:15:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1795278302, now seen corresponding path program 1 times [2022-11-02 20:15:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:58,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851487145] [2022-11-02 20:15:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:59,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851487145] [2022-11-02 20:15:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851487145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:15:59,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:15:59,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:15:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531506250] [2022-11-02 20:15:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:15:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:15:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:15:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:15:59,019 INFO L87 Difference]: Start difference. First operand 223 states and 349 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:00,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:00,642 INFO L93 Difference]: Finished difference Result 438 states and 688 transitions. [2022-11-02 20:16:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-02 20:16:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:00,645 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:16:00,645 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 20:16:00,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:00,646 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 20 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:00,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 491 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:16:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 20:16:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2022-11-02 20:16:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.5675675675675675) internal successors, (348), 222 states have internal predecessors, (348), 0 states have call successors, (0), 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:16:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 348 transitions. [2022-11-02 20:16:00,657 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 348 transitions. Word has length 60 [2022-11-02 20:16:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:00,658 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 348 transitions. [2022-11-02 20:16:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2022-11-02 20:16:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:16:00,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:00,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:16:00,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -828700230, now seen corresponding path program 1 times [2022-11-02 20:16:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:00,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452639214] [2022-11-02 20:16:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:01,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452639214] [2022-11-02 20:16:01,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452639214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:01,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:01,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358991975] [2022-11-02 20:16:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:01,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:01,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:01,081 INFO L87 Difference]: Start difference. First operand 223 states and 348 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:02,165 INFO L93 Difference]: Finished difference Result 428 states and 674 transitions. [2022-11-02 20:16:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:02,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-02 20:16:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:02,167 INFO L225 Difference]: With dead ends: 428 [2022-11-02 20:16:02,167 INFO L226 Difference]: Without dead ends: 226 [2022-11-02 20:16:02,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:02,169 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:02,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:16:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-02 20:16:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2022-11-02 20:16:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.563063063063063) internal successors, (347), 222 states have internal predecessors, (347), 0 states have call successors, (0), 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:16:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 347 transitions. [2022-11-02 20:16:02,178 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 347 transitions. Word has length 61 [2022-11-02 20:16:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:02,179 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 347 transitions. [2022-11-02 20:16:02,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 347 transitions. [2022-11-02 20:16:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:16:02,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:02,180 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:02,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:16:02,181 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -155701422, now seen corresponding path program 1 times [2022-11-02 20:16:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:02,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517359510] [2022-11-02 20:16:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:02,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517359510] [2022-11-02 20:16:02,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517359510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:02,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:02,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882795375] [2022-11-02 20:16:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:02,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:02,496 INFO L87 Difference]: Start difference. First operand 223 states and 347 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:04,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:04,995 INFO L93 Difference]: Finished difference Result 465 states and 729 transitions. [2022-11-02 20:16:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-02 20:16:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:04,998 INFO L225 Difference]: With dead ends: 465 [2022-11-02 20:16:04,998 INFO L226 Difference]: Without dead ends: 263 [2022-11-02 20:16:04,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:05,000 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:05,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 509 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:16:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-02 20:16:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 245. [2022-11-02 20:16:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5655737704918034) internal successors, (382), 244 states have internal predecessors, (382), 0 states have call successors, (0), 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:16:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2022-11-02 20:16:05,016 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 61 [2022-11-02 20:16:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:05,017 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2022-11-02 20:16:05,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2022-11-02 20:16:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:16:05,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:05,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:16:05,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1685046125, now seen corresponding path program 1 times [2022-11-02 20:16:05,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:05,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733909193] [2022-11-02 20:16:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733909193] [2022-11-02 20:16:05,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733909193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:05,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:05,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685229812] [2022-11-02 20:16:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:05,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:05,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:05,430 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:06,444 INFO L93 Difference]: Finished difference Result 572 states and 899 transitions. [2022-11-02 20:16:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-02 20:16:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:06,447 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:16:06,447 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:16:06,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:06,449 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 154 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:06,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:16:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:16:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 245. [2022-11-02 20:16:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 244 states have internal predecessors, (378), 0 states have call successors, (0), 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:16:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 378 transitions. [2022-11-02 20:16:06,461 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 378 transitions. Word has length 75 [2022-11-02 20:16:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:06,461 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 378 transitions. [2022-11-02 20:16:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 378 transitions. [2022-11-02 20:16:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:16:06,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:06,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:06,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:16:06,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1474054876, now seen corresponding path program 1 times [2022-11-02 20:16:06,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:06,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975058400] [2022-11-02 20:16:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975058400] [2022-11-02 20:16:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975058400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867925615] [2022-11-02 20:16:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:06,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:06,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:06,818 INFO L87 Difference]: Start difference. First operand 245 states and 378 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:07,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:08,370 INFO L93 Difference]: Finished difference Result 486 states and 754 transitions. [2022-11-02 20:16:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-02 20:16:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:08,373 INFO L225 Difference]: With dead ends: 486 [2022-11-02 20:16:08,373 INFO L226 Difference]: Without dead ends: 262 [2022-11-02 20:16:08,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:08,375 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 33 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:08,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 511 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:16:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-02 20:16:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 245. [2022-11-02 20:16:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5450819672131149) internal successors, (377), 244 states have internal predecessors, (377), 0 states have call successors, (0), 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:16:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 377 transitions. [2022-11-02 20:16:08,386 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 377 transitions. Word has length 75 [2022-11-02 20:16:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:08,387 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 377 transitions. [2022-11-02 20:16:08,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 377 transitions. [2022-11-02 20:16:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:16:08,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:08,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:08,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:16:08,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1898963311, now seen corresponding path program 1 times [2022-11-02 20:16:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:08,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965916561] [2022-11-02 20:16:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965916561] [2022-11-02 20:16:08,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965916561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:08,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:08,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640314232] [2022-11-02 20:16:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:08,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:08,860 INFO L87 Difference]: Start difference. First operand 245 states and 377 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:10,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:11,010 INFO L93 Difference]: Finished difference Result 572 states and 889 transitions. [2022-11-02 20:16:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-02 20:16:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:11,013 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:16:11,013 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:16:11,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:11,015 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 152 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:11,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:16:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:16:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 245. [2022-11-02 20:16:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.528688524590164) internal successors, (373), 244 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 373 transitions. [2022-11-02 20:16:11,027 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 373 transitions. Word has length 76 [2022-11-02 20:16:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:11,028 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 373 transitions. [2022-11-02 20:16:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 373 transitions. [2022-11-02 20:16:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:16:11,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:11,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:11,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:16:11,030 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:11,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash -287663058, now seen corresponding path program 1 times [2022-11-02 20:16:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741786481] [2022-11-02 20:16:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741786481] [2022-11-02 20:16:11,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741786481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:11,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:11,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:11,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069624543] [2022-11-02 20:16:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:11,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:11,445 INFO L87 Difference]: Start difference. First operand 245 states and 373 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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:16:13,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:14,075 INFO L93 Difference]: Finished difference Result 572 states and 881 transitions. [2022-11-02 20:16:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-11-02 20:16:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:14,078 INFO L225 Difference]: With dead ends: 572 [2022-11-02 20:16:14,078 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:16:14,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:14,080 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 150 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:14,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 346 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:16:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:16:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 245. [2022-11-02 20:16:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5122950819672132) internal successors, (369), 244 states have internal predecessors, (369), 0 states have call successors, (0), 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:16:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 369 transitions. [2022-11-02 20:16:14,092 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 369 transitions. Word has length 77 [2022-11-02 20:16:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:14,093 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 369 transitions. [2022-11-02 20:16:14,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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:16:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 369 transitions. [2022-11-02 20:16:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:16:14,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:14,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:14,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:16:14,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -975372950, now seen corresponding path program 1 times [2022-11-02 20:16:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:14,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492517966] [2022-11-02 20:16:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:14,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492517966] [2022-11-02 20:16:14,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492517966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:14,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:14,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230184171] [2022-11-02 20:16:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:14,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:14,522 INFO L87 Difference]: Start difference. First operand 245 states and 369 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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:16:15,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:16,505 INFO L93 Difference]: Finished difference Result 562 states and 860 transitions. [2022-11-02 20:16:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-11-02 20:16:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:16,508 INFO L225 Difference]: With dead ends: 562 [2022-11-02 20:16:16,508 INFO L226 Difference]: Without dead ends: 338 [2022-11-02 20:16:16,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:16,509 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:16,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 366 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:16:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-02 20:16:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 245. [2022-11-02 20:16:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 244 states have internal predecessors, (365), 0 states have call successors, (0), 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:16:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2022-11-02 20:16:16,522 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 78 [2022-11-02 20:16:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:16,522 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2022-11-02 20:16:16,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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:16:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2022-11-02 20:16:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:16:16,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:16,524 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:16,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:16:16,525 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1326691021, now seen corresponding path program 1 times [2022-11-02 20:16:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:16,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433641141] [2022-11-02 20:16:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:17,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433641141] [2022-11-02 20:16:17,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433641141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:17,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783297732] [2022-11-02 20:16:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:17,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:17,039 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:16:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:18,060 INFO L93 Difference]: Finished difference Result 562 states and 852 transitions. [2022-11-02 20:16:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:18,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 83 [2022-11-02 20:16:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:18,064 INFO L225 Difference]: With dead ends: 562 [2022-11-02 20:16:18,064 INFO L226 Difference]: Without dead ends: 338 [2022-11-02 20:16:18,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:18,065 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 115 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:18,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 380 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:16:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-02 20:16:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2022-11-02 20:16:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5355805243445693) internal successors, (410), 267 states have internal predecessors, (410), 0 states have call successors, (0), 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:16:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2022-11-02 20:16:18,078 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 83 [2022-11-02 20:16:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:18,079 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2022-11-02 20:16:18,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:16:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2022-11-02 20:16:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:16:18,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:18,081 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:18,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:16:18,082 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2060820195, now seen corresponding path program 1 times [2022-11-02 20:16:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:18,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872770733] [2022-11-02 20:16:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:18,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872770733] [2022-11-02 20:16:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872770733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:18,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:18,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238659712] [2022-11-02 20:16:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:18,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:18,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:18,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:18,589 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:16:19,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:20,252 INFO L93 Difference]: Finished difference Result 602 states and 928 transitions. [2022-11-02 20:16:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2022-11-02 20:16:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:20,255 INFO L225 Difference]: With dead ends: 602 [2022-11-02 20:16:20,255 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 20:16:20,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:20,257 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 84 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:20,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 487 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:16:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 20:16:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 302. [2022-11-02 20:16:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.5382059800664452) internal successors, (463), 301 states have internal predecessors, (463), 0 states have call successors, (0), 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:16:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 463 transitions. [2022-11-02 20:16:20,271 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 463 transitions. Word has length 111 [2022-11-02 20:16:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:20,271 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 463 transitions. [2022-11-02 20:16:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:16:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 463 transitions. [2022-11-02 20:16:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:16:20,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:20,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:16:20,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1280206943, now seen corresponding path program 1 times [2022-11-02 20:16:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915681090] [2022-11-02 20:16:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:20,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915681090] [2022-11-02 20:16:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915681090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:20,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:20,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078941112] [2022-11-02 20:16:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:20,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:20,798 INFO L87 Difference]: Start difference. First operand 302 states and 463 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:16:22,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:23,243 INFO L93 Difference]: Finished difference Result 729 states and 1130 transitions. [2022-11-02 20:16:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 111 [2022-11-02 20:16:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:23,247 INFO L225 Difference]: With dead ends: 729 [2022-11-02 20:16:23,247 INFO L226 Difference]: Without dead ends: 448 [2022-11-02 20:16:23,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:23,249 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:23,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 376 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:16:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-11-02 20:16:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 332. [2022-11-02 20:16:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.5468277945619335) internal successors, (512), 331 states have internal predecessors, (512), 0 states have call successors, (0), 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:16:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 512 transitions. [2022-11-02 20:16:23,265 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 512 transitions. Word has length 111 [2022-11-02 20:16:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:23,266 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 512 transitions. [2022-11-02 20:16:23,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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:16:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 512 transitions. [2022-11-02 20:16:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:16:23,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:23,268 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:23,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:16:23,269 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -180952980, now seen corresponding path program 1 times [2022-11-02 20:16:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:23,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041103714] [2022-11-02 20:16:23,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:23,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:23,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041103714] [2022-11-02 20:16:23,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041103714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:23,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:23,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:23,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748939747] [2022-11-02 20:16:23,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:23,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:23,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:23,798 INFO L87 Difference]: Start difference. First operand 332 states and 512 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:16:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:24,953 INFO L93 Difference]: Finished difference Result 753 states and 1165 transitions. [2022-11-02 20:16:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:24,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 117 [2022-11-02 20:16:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:24,957 INFO L225 Difference]: With dead ends: 753 [2022-11-02 20:16:24,957 INFO L226 Difference]: Without dead ends: 442 [2022-11-02 20:16:24,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:24,959 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 117 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:24,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 364 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:16:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-02 20:16:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 369. [2022-11-02 20:16:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.5516304347826086) internal successors, (571), 368 states have internal predecessors, (571), 0 states have call successors, (0), 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:16:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 571 transitions. [2022-11-02 20:16:24,976 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 571 transitions. Word has length 117 [2022-11-02 20:16:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:24,977 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 571 transitions. [2022-11-02 20:16:24,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:16:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 571 transitions. [2022-11-02 20:16:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:16:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:24,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:24,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:16:24,980 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash 544267447, now seen corresponding path program 1 times [2022-11-02 20:16:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:24,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560763768] [2022-11-02 20:16:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:25,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560763768] [2022-11-02 20:16:25,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560763768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:25,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:25,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274377040] [2022-11-02 20:16:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:25,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:25,437 INFO L87 Difference]: Start difference. First operand 369 states and 571 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:26,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:26,962 INFO L93 Difference]: Finished difference Result 801 states and 1244 transitions. [2022-11-02 20:16:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-11-02 20:16:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:26,965 INFO L225 Difference]: With dead ends: 801 [2022-11-02 20:16:26,965 INFO L226 Difference]: Without dead ends: 453 [2022-11-02 20:16:26,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:26,966 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 73 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:26,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 489 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:16:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-11-02 20:16:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 409. [2022-11-02 20:16:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.553921568627451) internal successors, (634), 408 states have internal predecessors, (634), 0 states have call successors, (0), 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:16:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 634 transitions. [2022-11-02 20:16:26,988 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 634 transitions. Word has length 118 [2022-11-02 20:16:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:26,989 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 634 transitions. [2022-11-02 20:16:26,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 634 transitions. [2022-11-02 20:16:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:16:26,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:26,992 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:26,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:16:26,993 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2016595399, now seen corresponding path program 1 times [2022-11-02 20:16:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:26,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195708981] [2022-11-02 20:16:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:16:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195708981] [2022-11-02 20:16:27,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195708981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:27,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:27,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957001013] [2022-11-02 20:16:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:27,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:27,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:27,475 INFO L87 Difference]: Start difference. First operand 409 states and 634 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:29,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:29,853 INFO L93 Difference]: Finished difference Result 834 states and 1297 transitions. [2022-11-02 20:16:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-11-02 20:16:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:29,859 INFO L225 Difference]: With dead ends: 834 [2022-11-02 20:16:29,859 INFO L226 Difference]: Without dead ends: 446 [2022-11-02 20:16:29,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:29,861 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 28 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:29,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 589 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:16:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-11-02 20:16:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 433. [2022-11-02 20:16:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 1.5486111111111112) internal successors, (669), 432 states have internal predecessors, (669), 0 states have call successors, (0), 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:16:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2022-11-02 20:16:29,879 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 118 [2022-11-02 20:16:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:29,880 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2022-11-02 20:16:29,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2022-11-02 20:16:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-02 20:16:29,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:29,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:29,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:16:29,883 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1059495169, now seen corresponding path program 1 times [2022-11-02 20:16:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:29,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951566595] [2022-11-02 20:16:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:16:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:30,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951566595] [2022-11-02 20:16:30,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951566595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:30,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:30,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180417986] [2022-11-02 20:16:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:30,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:30,433 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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:16:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:31,528 INFO L93 Difference]: Finished difference Result 883 states and 1367 transitions. [2022-11-02 20:16:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 125 [2022-11-02 20:16:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:31,532 INFO L225 Difference]: With dead ends: 883 [2022-11-02 20:16:31,532 INFO L226 Difference]: Without dead ends: 471 [2022-11-02 20:16:31,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:31,534 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 61 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:31,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 495 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:16:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-02 20:16:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 436. [2022-11-02 20:16:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5448275862068965) internal successors, (672), 435 states have internal predecessors, (672), 0 states have call successors, (0), 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:16:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 672 transitions. [2022-11-02 20:16:31,558 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 672 transitions. Word has length 125 [2022-11-02 20:16:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:31,558 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 672 transitions. [2022-11-02 20:16:31,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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:16:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 672 transitions. [2022-11-02 20:16:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:16:31,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:31,563 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:16:31,564 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash 492781613, now seen corresponding path program 1 times [2022-11-02 20:16:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334571686] [2022-11-02 20:16:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:32,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334571686] [2022-11-02 20:16:32,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334571686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:32,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:32,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401104359] [2022-11-02 20:16:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:32,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:32,040 INFO L87 Difference]: Start difference. First operand 436 states and 672 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:34,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:34,569 INFO L93 Difference]: Finished difference Result 885 states and 1368 transitions. [2022-11-02 20:16:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 132 [2022-11-02 20:16:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:34,572 INFO L225 Difference]: With dead ends: 885 [2022-11-02 20:16:34,572 INFO L226 Difference]: Without dead ends: 470 [2022-11-02 20:16:34,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:34,574 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 83 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:34,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 497 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:16:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-02 20:16:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 436. [2022-11-02 20:16:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.542528735632184) internal successors, (671), 435 states have internal predecessors, (671), 0 states have call successors, (0), 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:16:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 671 transitions. [2022-11-02 20:16:34,593 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 671 transitions. Word has length 132 [2022-11-02 20:16:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:34,593 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 671 transitions. [2022-11-02 20:16:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 671 transitions. [2022-11-02 20:16:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:16:34,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:34,596 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:34,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:16:34,597 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -277951953, now seen corresponding path program 1 times [2022-11-02 20:16:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:34,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725713418] [2022-11-02 20:16:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725713418] [2022-11-02 20:16:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725713418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:35,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:35,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255099312] [2022-11-02 20:16:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:35,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:35,029 INFO L87 Difference]: Start difference. First operand 436 states and 671 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:35,973 INFO L93 Difference]: Finished difference Result 863 states and 1334 transitions. [2022-11-02 20:16:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 132 [2022-11-02 20:16:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:35,976 INFO L225 Difference]: With dead ends: 863 [2022-11-02 20:16:35,977 INFO L226 Difference]: Without dead ends: 448 [2022-11-02 20:16:35,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:35,978 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 33 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:35,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 589 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:16:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-11-02 20:16:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 436. [2022-11-02 20:16:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5402298850574712) internal successors, (670), 435 states have internal predecessors, (670), 0 states have call successors, (0), 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:16:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 670 transitions. [2022-11-02 20:16:35,995 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 670 transitions. Word has length 132 [2022-11-02 20:16:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:35,996 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 670 transitions. [2022-11-02 20:16:35,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 670 transitions. [2022-11-02 20:16:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:16:35,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:35,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:35,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:16:36,000 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 65033270, now seen corresponding path program 1 times [2022-11-02 20:16:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:36,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697314996] [2022-11-02 20:16:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:16:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:36,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697314996] [2022-11-02 20:16:36,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697314996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:36,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:36,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006095612] [2022-11-02 20:16:36,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:36,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:36,553 INFO L87 Difference]: Start difference. First operand 436 states and 670 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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:16:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:37,684 INFO L93 Difference]: Finished difference Result 961 states and 1480 transitions. [2022-11-02 20:16:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:37,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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) Word has length 138 [2022-11-02 20:16:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:37,688 INFO L225 Difference]: With dead ends: 961 [2022-11-02 20:16:37,688 INFO L226 Difference]: Without dead ends: 546 [2022-11-02 20:16:37,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:37,689 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 124 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:37,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 380 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:16:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-02 20:16:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 466. [2022-11-02 20:16:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.5311827956989248) internal successors, (712), 465 states have internal predecessors, (712), 0 states have call successors, (0), 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:16:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 712 transitions. [2022-11-02 20:16:37,710 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 712 transitions. Word has length 138 [2022-11-02 20:16:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:37,710 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 712 transitions. [2022-11-02 20:16:37,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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:16:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 712 transitions. [2022-11-02 20:16:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 20:16:37,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:37,713 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:37,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:16:37,714 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1134974160, now seen corresponding path program 1 times [2022-11-02 20:16:37,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:37,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095952489] [2022-11-02 20:16:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:16:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095952489] [2022-11-02 20:16:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095952489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309731585] [2022-11-02 20:16:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:38,232 INFO L87 Difference]: Start difference. First operand 466 states and 712 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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:16:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:39,257 INFO L93 Difference]: Finished difference Result 981 states and 1500 transitions. [2022-11-02 20:16:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:39,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 139 [2022-11-02 20:16:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:39,263 INFO L225 Difference]: With dead ends: 981 [2022-11-02 20:16:39,263 INFO L226 Difference]: Without dead ends: 536 [2022-11-02 20:16:39,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:39,265 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 123 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:39,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 364 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:16:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-02 20:16:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 466. [2022-11-02 20:16:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.5182795698924731) internal successors, (706), 465 states have internal predecessors, (706), 0 states have call successors, (0), 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:16:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 706 transitions. [2022-11-02 20:16:39,285 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 706 transitions. Word has length 139 [2022-11-02 20:16:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:39,285 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 706 transitions. [2022-11-02 20:16:39,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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:16:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 706 transitions. [2022-11-02 20:16:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:16:39,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:39,288 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:39,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:16:39,289 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash -658742582, now seen corresponding path program 1 times [2022-11-02 20:16:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:39,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290057235] [2022-11-02 20:16:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:39,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:39,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290057235] [2022-11-02 20:16:39,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290057235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:39,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457375755] [2022-11-02 20:16:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:39,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:39,768 INFO L87 Difference]: Start difference. First operand 466 states and 706 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:41,114 INFO L93 Difference]: Finished difference Result 943 states and 1434 transitions. [2022-11-02 20:16:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-11-02 20:16:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:41,117 INFO L225 Difference]: With dead ends: 943 [2022-11-02 20:16:41,117 INFO L226 Difference]: Without dead ends: 498 [2022-11-02 20:16:41,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:41,119 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:41,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 515 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:16:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-02 20:16:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 466. [2022-11-02 20:16:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.5161290322580645) internal successors, (705), 465 states have internal predecessors, (705), 0 states have call successors, (0), 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:16:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2022-11-02 20:16:41,139 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 140 [2022-11-02 20:16:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:41,139 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2022-11-02 20:16:41,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2022-11-02 20:16:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:16:41,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:41,142 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:41,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:16:41,143 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash 942328524, now seen corresponding path program 1 times [2022-11-02 20:16:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:41,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288753207] [2022-11-02 20:16:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:16:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:41,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288753207] [2022-11-02 20:16:41,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288753207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:41,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:41,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:16:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442969041] [2022-11-02 20:16:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:16:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:16:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:16:41,346 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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:16:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:41,431 INFO L93 Difference]: Finished difference Result 1351 states and 2059 transitions. [2022-11-02 20:16:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:16:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 140 [2022-11-02 20:16:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:41,435 INFO L225 Difference]: With dead ends: 1351 [2022-11-02 20:16:41,435 INFO L226 Difference]: Without dead ends: 906 [2022-11-02 20:16:41,437 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:16:41,442 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:41,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 426 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-02 20:16:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2022-11-02 20:16:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.512735326688815) internal successors, (1366), 903 states have internal predecessors, (1366), 0 states have call successors, (0), 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:16:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1366 transitions. [2022-11-02 20:16:41,479 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1366 transitions. Word has length 140 [2022-11-02 20:16:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:41,480 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 1366 transitions. [2022-11-02 20:16:41,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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:16:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1366 transitions. [2022-11-02 20:16:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:16:41,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:41,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:41,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:16:41,484 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -903038642, now seen corresponding path program 1 times [2022-11-02 20:16:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708317152] [2022-11-02 20:16:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:16:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:41,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708317152] [2022-11-02 20:16:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708317152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185663138] [2022-11-02 20:16:41,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:41,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:41,884 INFO L87 Difference]: Start difference. First operand 904 states and 1366 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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:16:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:42,617 INFO L93 Difference]: Finished difference Result 1868 states and 2825 transitions. [2022-11-02 20:16:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 140 [2022-11-02 20:16:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:42,621 INFO L225 Difference]: With dead ends: 1868 [2022-11-02 20:16:42,622 INFO L226 Difference]: Without dead ends: 985 [2022-11-02 20:16:42,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:42,624 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 31 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:42,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 589 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:16:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-11-02 20:16:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 956. [2022-11-02 20:16:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.5120418848167538) internal successors, (1444), 955 states have internal predecessors, (1444), 0 states have call successors, (0), 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:16:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1444 transitions. [2022-11-02 20:16:42,661 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1444 transitions. Word has length 140 [2022-11-02 20:16:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:42,662 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1444 transitions. [2022-11-02 20:16:42,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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:16:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1444 transitions. [2022-11-02 20:16:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-02 20:16:42,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:42,666 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:42,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:16:42,666 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2107256807, now seen corresponding path program 1 times [2022-11-02 20:16:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:42,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910176855] [2022-11-02 20:16:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:16:43,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:43,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910176855] [2022-11-02 20:16:43,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910176855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:43,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:43,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:43,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186874001] [2022-11-02 20:16:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:43,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:43,269 INFO L87 Difference]: Start difference. First operand 956 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:44,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:45,055 INFO L93 Difference]: Finished difference Result 2106 states and 3173 transitions. [2022-11-02 20:16:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-11-02 20:16:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:45,061 INFO L225 Difference]: With dead ends: 2106 [2022-11-02 20:16:45,062 INFO L226 Difference]: Without dead ends: 1171 [2022-11-02 20:16:45,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:45,064 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:45,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 380 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:16:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-11-02 20:16:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1012. [2022-11-02 20:16:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.5014836795252227) internal successors, (1518), 1011 states have internal predecessors, (1518), 0 states have call successors, (0), 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:16:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1518 transitions. [2022-11-02 20:16:45,107 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1518 transitions. Word has length 142 [2022-11-02 20:16:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:45,108 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1518 transitions. [2022-11-02 20:16:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1518 transitions. [2022-11-02 20:16:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 20:16:45,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:45,112 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:45,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:16:45,113 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash 271946515, now seen corresponding path program 1 times [2022-11-02 20:16:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055897663] [2022-11-02 20:16:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:16:45,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:45,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055897663] [2022-11-02 20:16:45,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055897663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:45,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:45,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522257462] [2022-11-02 20:16:45,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:45,559 INFO L87 Difference]: Start difference. First operand 1012 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:16:46,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:47,275 INFO L93 Difference]: Finished difference Result 2050 states and 3072 transitions. [2022-11-02 20:16:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 143 [2022-11-02 20:16:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:47,278 INFO L225 Difference]: With dead ends: 2050 [2022-11-02 20:16:47,278 INFO L226 Difference]: Without dead ends: 1059 [2022-11-02 20:16:47,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:47,286 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 57 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:47,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 533 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:16:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-11-02 20:16:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1012. [2022-11-02 20:16:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.499505440158259) internal successors, (1516), 1011 states have internal predecessors, (1516), 0 states have call successors, (0), 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:16:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1516 transitions. [2022-11-02 20:16:47,331 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1516 transitions. Word has length 143 [2022-11-02 20:16:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:47,332 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1516 transitions. [2022-11-02 20:16:47,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:16:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1516 transitions. [2022-11-02 20:16:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-02 20:16:47,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:47,339 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:47,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:16:47,339 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1420337599, now seen corresponding path program 1 times [2022-11-02 20:16:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866560332] [2022-11-02 20:16:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:47,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866560332] [2022-11-02 20:16:47,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866560332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:47,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:47,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648870520] [2022-11-02 20:16:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:47,841 INFO L87 Difference]: Start difference. First operand 1012 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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:16:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:48,739 INFO L93 Difference]: Finished difference Result 2138 states and 3193 transitions. [2022-11-02 20:16:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 146 [2022-11-02 20:16:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:48,744 INFO L225 Difference]: With dead ends: 2138 [2022-11-02 20:16:48,744 INFO L226 Difference]: Without dead ends: 1147 [2022-11-02 20:16:48,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:48,745 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 127 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:48,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 368 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:16:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-11-02 20:16:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1012. [2022-11-02 20:16:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4836795252225519) internal successors, (1500), 1011 states have internal predecessors, (1500), 0 states have call successors, (0), 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:16:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1500 transitions. [2022-11-02 20:16:48,789 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1500 transitions. Word has length 146 [2022-11-02 20:16:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:48,789 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1500 transitions. [2022-11-02 20:16:48,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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:16:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1500 transitions. [2022-11-02 20:16:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-02 20:16:48,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:48,792 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:48,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:16:48,793 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash -72635493, now seen corresponding path program 1 times [2022-11-02 20:16:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:48,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117944582] [2022-11-02 20:16:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117944582] [2022-11-02 20:16:49,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117944582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:49,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:49,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768139316] [2022-11-02 20:16:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:49,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:49,288 INFO L87 Difference]: Start difference. First operand 1012 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:50,457 INFO L93 Difference]: Finished difference Result 2138 states and 3161 transitions. [2022-11-02 20:16:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:50,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 147 [2022-11-02 20:16:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:50,463 INFO L225 Difference]: With dead ends: 2138 [2022-11-02 20:16:50,463 INFO L226 Difference]: Without dead ends: 1147 [2022-11-02 20:16:50,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:50,465 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 126 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:50,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 364 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:16:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-11-02 20:16:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1012. [2022-11-02 20:16:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4678536102868447) internal successors, (1484), 1011 states have internal predecessors, (1484), 0 states have call successors, (0), 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:16:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1484 transitions. [2022-11-02 20:16:50,535 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1484 transitions. Word has length 147 [2022-11-02 20:16:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:50,536 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1484 transitions. [2022-11-02 20:16:50,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1484 transitions. [2022-11-02 20:16:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:16:50,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:50,547 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:16:50,547 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash -194194128, now seen corresponding path program 1 times [2022-11-02 20:16:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:50,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068960691] [2022-11-02 20:16:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-02 20:16:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:51,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068960691] [2022-11-02 20:16:51,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068960691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:51,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:51,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596570673] [2022-11-02 20:16:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:51,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:51,032 INFO L87 Difference]: Start difference. First operand 1012 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:52,460 INFO L93 Difference]: Finished difference Result 2218 states and 3247 transitions. [2022-11-02 20:16:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:52,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-11-02 20:16:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:52,466 INFO L225 Difference]: With dead ends: 2218 [2022-11-02 20:16:52,466 INFO L226 Difference]: Without dead ends: 1227 [2022-11-02 20:16:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:52,468 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 117 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:52,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 364 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:16:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-11-02 20:16:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1082. [2022-11-02 20:16:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 1.461609620721554) internal successors, (1580), 1081 states have internal predecessors, (1580), 0 states have call successors, (0), 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:16:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1580 transitions. [2022-11-02 20:16:52,517 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1580 transitions. Word has length 150 [2022-11-02 20:16:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:52,517 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1580 transitions. [2022-11-02 20:16:52,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1580 transitions. [2022-11-02 20:16:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:16:52,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:52,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:16:52,521 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1452774436, now seen corresponding path program 1 times [2022-11-02 20:16:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:52,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334132068] [2022-11-02 20:16:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:52,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334132068] [2022-11-02 20:16:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334132068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466314415] [2022-11-02 20:16:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:52,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:52,966 INFO L87 Difference]: Start difference. First operand 1082 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:54,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:55,544 INFO L93 Difference]: Finished difference Result 2358 states and 3439 transitions. [2022-11-02 20:16:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-11-02 20:16:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:55,548 INFO L225 Difference]: With dead ends: 2358 [2022-11-02 20:16:55,548 INFO L226 Difference]: Without dead ends: 1297 [2022-11-02 20:16:55,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:55,551 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:55,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 374 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:16:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-11-02 20:16:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1148. [2022-11-02 20:16:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4542284219703574) internal successors, (1668), 1147 states have internal predecessors, (1668), 0 states have call successors, (0), 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:16:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1668 transitions. [2022-11-02 20:16:55,603 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1668 transitions. Word has length 150 [2022-11-02 20:16:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:55,603 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1668 transitions. [2022-11-02 20:16:55,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1668 transitions. [2022-11-02 20:16:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 20:16:55,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:55,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:55,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:16:55,608 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1899790727, now seen corresponding path program 1 times [2022-11-02 20:16:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:55,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539826330] [2022-11-02 20:16:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:16:55,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:55,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539826330] [2022-11-02 20:16:55,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539826330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:55,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:55,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476086937] [2022-11-02 20:16:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:55,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:55,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:55,998 INFO L87 Difference]: Start difference. First operand 1148 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:57,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:16:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:57,843 INFO L93 Difference]: Finished difference Result 2306 states and 3350 transitions. [2022-11-02 20:16:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:57,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-11-02 20:16:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:57,847 INFO L225 Difference]: With dead ends: 2306 [2022-11-02 20:16:57,848 INFO L226 Difference]: Without dead ends: 1179 [2022-11-02 20:16:57,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:57,850 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 39 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:57,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 543 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:16:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-02 20:16:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1148. [2022-11-02 20:16:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4524847428073235) internal successors, (1666), 1147 states have internal predecessors, (1666), 0 states have call successors, (0), 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:16:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1666 transitions. [2022-11-02 20:16:57,901 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1666 transitions. Word has length 151 [2022-11-02 20:16:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:57,901 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1666 transitions. [2022-11-02 20:16:57,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1666 transitions. [2022-11-02 20:16:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 20:16:57,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:57,905 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:57,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:16:57,905 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2064980709, now seen corresponding path program 1 times [2022-11-02 20:16:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904865899] [2022-11-02 20:16:57,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-02 20:16:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:58,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904865899] [2022-11-02 20:16:58,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904865899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:58,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:58,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786336771] [2022-11-02 20:16:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:58,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:58,413 INFO L87 Difference]: Start difference. First operand 1148 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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:16:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:59,461 INFO L93 Difference]: Finished difference Result 2300 states and 3339 transitions. [2022-11-02 20:16:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:59,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 151 [2022-11-02 20:16:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:59,467 INFO L225 Difference]: With dead ends: 2300 [2022-11-02 20:16:59,467 INFO L226 Difference]: Without dead ends: 1173 [2022-11-02 20:16:59,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:59,471 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 33 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:59,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 545 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:16:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-02 20:16:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1148. [2022-11-02 20:16:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4507410636442895) internal successors, (1664), 1147 states have internal predecessors, (1664), 0 states have call successors, (0), 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:16:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1664 transitions. [2022-11-02 20:16:59,521 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1664 transitions. Word has length 151 [2022-11-02 20:16:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:59,522 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1664 transitions. [2022-11-02 20:16:59,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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:16:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1664 transitions. [2022-11-02 20:16:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 20:16:59,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:59,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:59,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:16:59,526 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1423813628, now seen corresponding path program 1 times [2022-11-02 20:16:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:59,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932238152] [2022-11-02 20:16:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 20:16:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932238152] [2022-11-02 20:16:59,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932238152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:59,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:59,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139131976] [2022-11-02 20:16:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:59,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:59,932 INFO L87 Difference]: Start difference. First operand 1148 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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:17:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:01,317 INFO L93 Difference]: Finished difference Result 2430 states and 3521 transitions. [2022-11-02 20:17:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 154 [2022-11-02 20:17:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:01,324 INFO L225 Difference]: With dead ends: 2430 [2022-11-02 20:17:01,324 INFO L226 Difference]: Without dead ends: 1303 [2022-11-02 20:17:01,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:01,327 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 64 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:01,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 561 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:17:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2022-11-02 20:17:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1224. [2022-11-02 20:17:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 1.4488961569910057) internal successors, (1772), 1223 states have internal predecessors, (1772), 0 states have call successors, (0), 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:17:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1772 transitions. [2022-11-02 20:17:01,391 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1772 transitions. Word has length 154 [2022-11-02 20:17:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:01,392 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1772 transitions. [2022-11-02 20:17:01,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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:17:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1772 transitions. [2022-11-02 20:17:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-02 20:17:01,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:01,397 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:01,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:17:01,398 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash -959672524, now seen corresponding path program 1 times [2022-11-02 20:17:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:01,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606944385] [2022-11-02 20:17:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:17:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606944385] [2022-11-02 20:17:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606944385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:01,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:01,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479726748] [2022-11-02 20:17:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:01,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:01,853 INFO L87 Difference]: Start difference. First operand 1224 states and 1772 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:17:03,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:04,333 INFO L93 Difference]: Finished difference Result 2562 states and 3705 transitions. [2022-11-02 20:17:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 159 [2022-11-02 20:17:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:04,337 INFO L225 Difference]: With dead ends: 2562 [2022-11-02 20:17:04,337 INFO L226 Difference]: Without dead ends: 1359 [2022-11-02 20:17:04,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:04,339 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 113 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:04,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 364 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:17:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-02 20:17:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1148. [2022-11-02 20:17:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4472537053182215) internal successors, (1660), 1147 states have internal predecessors, (1660), 0 states have call successors, (0), 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:17:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1660 transitions. [2022-11-02 20:17:04,391 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1660 transitions. Word has length 159 [2022-11-02 20:17:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:04,391 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1660 transitions. [2022-11-02 20:17:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:17:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1660 transitions. [2022-11-02 20:17:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-02 20:17:04,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:04,395 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:17:04,395 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1913666090, now seen corresponding path program 1 times [2022-11-02 20:17:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:04,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490231886] [2022-11-02 20:17:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 20:17:04,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490231886] [2022-11-02 20:17:04,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490231886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:04,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:04,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579775183] [2022-11-02 20:17:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:04,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:04,836 INFO L87 Difference]: Start difference. First operand 1148 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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:17:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:05,785 INFO L93 Difference]: Finished difference Result 2430 states and 3511 transitions. [2022-11-02 20:17:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:05,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 161 [2022-11-02 20:17:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:05,791 INFO L225 Difference]: With dead ends: 2430 [2022-11-02 20:17:05,791 INFO L226 Difference]: Without dead ends: 1303 [2022-11-02 20:17:05,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:05,793 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 58 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:05,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 563 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:17:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2022-11-02 20:17:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1234. [2022-11-02 20:17:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 1.4452554744525548) internal successors, (1782), 1233 states have internal predecessors, (1782), 0 states have call successors, (0), 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:17:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1782 transitions. [2022-11-02 20:17:05,848 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1782 transitions. Word has length 161 [2022-11-02 20:17:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:05,849 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1782 transitions. [2022-11-02 20:17:05,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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:17:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1782 transitions. [2022-11-02 20:17:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 20:17:05,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:05,852 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:17:05,853 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1438221833, now seen corresponding path program 1 times [2022-11-02 20:17:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659354749] [2022-11-02 20:17:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 20:17:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:06,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659354749] [2022-11-02 20:17:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659354749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:06,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:06,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281267515] [2022-11-02 20:17:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:06,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:06,165 INFO L87 Difference]: Start difference. First operand 1234 states and 1782 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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:17:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:07,395 INFO L93 Difference]: Finished difference Result 2510 states and 3624 transitions. [2022-11-02 20:17:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 162 [2022-11-02 20:17:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:07,400 INFO L225 Difference]: With dead ends: 2510 [2022-11-02 20:17:07,401 INFO L226 Difference]: Without dead ends: 1293 [2022-11-02 20:17:07,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:07,403 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 54 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:07,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 565 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:17:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-11-02 20:17:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1232. [2022-11-02 20:17:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4443541835905767) internal successors, (1778), 1231 states have internal predecessors, (1778), 0 states have call successors, (0), 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:17:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1778 transitions. [2022-11-02 20:17:07,456 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1778 transitions. Word has length 162 [2022-11-02 20:17:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:07,457 INFO L495 AbstractCegarLoop]: Abstraction has 1232 states and 1778 transitions. [2022-11-02 20:17:07,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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:17:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1778 transitions. [2022-11-02 20:17:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-02 20:17:07,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:07,460 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:07,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:17:07,461 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1049990310, now seen corresponding path program 1 times [2022-11-02 20:17:07,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:07,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328865139] [2022-11-02 20:17:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-11-02 20:17:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328865139] [2022-11-02 20:17:10,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328865139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790894145] [2022-11-02 20:17:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:10,362 INFO L87 Difference]: Start difference. First operand 1232 states and 1778 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:11,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:17:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:13,333 INFO L93 Difference]: Finished difference Result 2461 states and 3552 transitions. [2022-11-02 20:17:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:13,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-11-02 20:17:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:13,338 INFO L225 Difference]: With dead ends: 2461 [2022-11-02 20:17:13,338 INFO L226 Difference]: Without dead ends: 1232 [2022-11-02 20:17:13,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:17:13,340 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:13,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 687 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:17:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-02 20:17:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2022-11-02 20:17:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.4435418359057677) internal successors, (1777), 1231 states have internal predecessors, (1777), 0 states have call successors, (0), 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:17:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1777 transitions. [2022-11-02 20:17:13,400 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1777 transitions. Word has length 166 [2022-11-02 20:17:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:13,401 INFO L495 AbstractCegarLoop]: Abstraction has 1232 states and 1777 transitions. [2022-11-02 20:17:13,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1777 transitions. [2022-11-02 20:17:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-02 20:17:13,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:13,404 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:13,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:17:13,404 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:13,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash -674618012, now seen corresponding path program 1 times [2022-11-02 20:17:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:13,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721779381] [2022-11-02 20:17:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:17:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:37,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721779381] [2022-11-02 20:17:37,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721779381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:17:37,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023756818] [2022-11-02 20:17:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:37,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:17:37,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9619a9d-154a-4a88-8058-7f76e4ca18ea/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:17:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:38,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 196 conjunts are in the unsatisfiable core [2022-11-02 20:17:38,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:17:38,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:38,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:39,258 INFO L356 Elim1Store]: treesize reduction 749, result has 4.0 percent of original size [2022-11-02 20:17:39,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 2268982857 treesize of output 793726961