./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79b55bbc1c83a113dd61cfbd1c59324170026eea9fc3fed8c2e488e492b32e33 --- 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-38b53e6 [2022-11-25 23:53:50,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:53:50,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:53:50,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:53:50,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:53:50,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:53:50,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:53:50,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:53:50,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:53:50,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:53:50,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:53:50,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:53:50,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:53:50,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:53:50,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:53:50,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:53:50,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:53:50,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:53:50,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:53:50,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:53:50,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:53:50,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:53:50,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:53:50,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:53:50,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:53:50,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:53:50,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:53:50,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:53:50,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:53:50,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:53:50,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:53:50,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:53:50,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:53:50,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:53:50,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:53:50,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:53:50,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:53:50,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:53:50,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:53:50,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:53:50,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:53:50,430 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:53:50,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:53:50,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:53:50,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:53:50,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:53:50,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:53:50,476 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:53:50,476 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:53:50,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:53:50,476 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:53:50,477 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:53:50,478 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:53:50,478 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:53:50,478 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:53:50,478 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:53:50,478 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:53:50,479 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:53:50,479 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:53:50,479 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:53:50,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:53:50,481 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:53:50,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:53:50,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:53:50,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:53:50,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:53:50,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:53:50,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:53:50,482 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:53:50,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:53:50,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:53:50,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:53:50,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:53:50,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:53:50,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:53:50,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:53:50,484 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:53:50,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:53:50,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:53:50,485 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:53:50,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:53:50,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:53:50,485 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:53:50,485 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_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/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_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> 79b55bbc1c83a113dd61cfbd1c59324170026eea9fc3fed8c2e488e492b32e33 [2022-11-25 23:53:50,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:53:50,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:53:50,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:53:50,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:53:50,841 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:53:50,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2022-11-25 23:53:53,933 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:53:54,312 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:53:54,313 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2022-11-25 23:53:54,335 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/data/0dd1e4190/2a7413decbbc49beaedb4f434e93fc1e/FLAGa62038caa [2022-11-25 23:53:54,352 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/data/0dd1e4190/2a7413decbbc49beaedb4f434e93fc1e [2022-11-25 23:53:54,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:53:54,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:53:54,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:53:54,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:53:54,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:53:54,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:53:54" (1/1) ... [2022-11-25 23:53:54,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8d825a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:54, skipping insertion in model container [2022-11-25 23:53:54,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:53:54" (1/1) ... [2022-11-25 23:53:54,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:53:54,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:53:55,334 WARN L237 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_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-11-25 23:53:55,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:53:55,443 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:53:55,528 WARN L237 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_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-11-25 23:53:55,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:53:55,701 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:53:55,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55 WrapperNode [2022-11-25 23:53:55,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:53:55,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:53:55,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:53:55,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:53:55,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,808 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-11-25 23:53:55,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:53:55,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:53:55,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:53:55,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:53:55,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,887 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:53:55,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:53:55,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:53:55,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:53:55,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (1/1) ... [2022-11-25 23:53:55,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:53:55,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:55,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:53:55,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:53:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:53:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:53:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 23:53:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:53:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:53:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:53:55,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:53:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-25 23:53:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-25 23:53:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:53:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:53:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:53:56,001 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:53:56,460 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:53:56,462 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:53:56,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:53:56,733 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:53:56,733 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:53:56,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:53:56 BoogieIcfgContainer [2022-11-25 23:53:56,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:53:56,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:53:56,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:53:56,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:53:56,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:53:54" (1/3) ... [2022-11-25 23:53:56,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d62d485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:53:56, skipping insertion in model container [2022-11-25 23:53:56,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:55" (2/3) ... [2022-11-25 23:53:56,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d62d485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:53:56, skipping insertion in model container [2022-11-25 23:53:56,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:53:56" (3/3) ... [2022-11-25 23:53:56,746 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-11-25 23:53:56,755 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:53:56,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:53:56,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-25 23:53:56,767 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:53:56,838 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 23:53:56,876 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:53:56,890 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 194 transitions, 404 flow [2022-11-25 23:53:56,893 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 194 transitions, 404 flow [2022-11-25 23:53:56,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 194 transitions, 404 flow [2022-11-25 23:53:57,000 INFO L130 PetriNetUnfolder]: 10/239 cut-off events. [2022-11-25 23:53:57,000 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 23:53:57,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 239 events. 10/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 390 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2022-11-25 23:53:57,010 INFO L119 LiptonReduction]: Number of co-enabled transitions 3224 [2022-11-25 23:54:58,784 INFO L134 LiptonReduction]: Checked pairs total: 7205 [2022-11-25 23:54:58,784 INFO L136 LiptonReduction]: Total number of compositions: 219 [2022-11-25 23:54:58,794 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 37 transitions, 90 flow [2022-11-25 23:54:58,847 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:58,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:54:58,875 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=FINITE_AUTOMATA, 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;@1480c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:54:58,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 23:54:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:54:58,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:58,885 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:54:58,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:54:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 687, now seen corresponding path program 1 times [2022-11-25 23:54:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:58,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067761391] [2022-11-25 23:54:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:59,198 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-25 23:54:59,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:59,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067761391] [2022-11-25 23:54:59,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067761391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:54:59,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:54:59,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:54:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754267367] [2022-11-25 23:54:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:59,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:54:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:54:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:54:59,249 INFO L87 Difference]: Start difference. First operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:59,381 INFO L93 Difference]: Finished difference Result 403 states and 993 transitions. [2022-11-25 23:54:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:54:59,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-25 23:54:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:59,407 INFO L225 Difference]: With dead ends: 403 [2022-11-25 23:54:59,408 INFO L226 Difference]: Without dead ends: 366 [2022-11-25 23:54:59,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:54:59,415 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:59,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:54:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-25 23:54:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-11-25 23:54:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 2.488888888888889) internal successors, (896), 365 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 896 transitions. [2022-11-25 23:54:59,480 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 896 transitions. Word has length 1 [2022-11-25 23:54:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:59,480 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 896 transitions. [2022-11-25 23:54:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 896 transitions. [2022-11-25 23:54:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:54:59,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:59,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:54:59,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:54:59,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:54:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 21166370, now seen corresponding path program 1 times [2022-11-25 23:54:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:59,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389234758] [2022-11-25 23:54:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:00,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:00,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389234758] [2022-11-25 23:55:00,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389234758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:00,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:00,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:55:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112781992] [2022-11-25 23:55:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:00,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:55:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:55:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:55:00,064 INFO L87 Difference]: Start difference. First operand 366 states and 896 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:00,246 INFO L93 Difference]: Finished difference Result 521 states and 1271 transitions. [2022-11-25 23:55:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:55:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-25 23:55:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:00,251 INFO L225 Difference]: With dead ends: 521 [2022-11-25 23:55:00,251 INFO L226 Difference]: Without dead ends: 521 [2022-11-25 23:55:00,252 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-25 23:55:00,253 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:00,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-11-25 23:55:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 425. [2022-11-25 23:55:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 2.5023809523809524) internal successors, (1051), 424 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1051 transitions. [2022-11-25 23:55:00,300 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1051 transitions. Word has length 4 [2022-11-25 23:55:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:00,300 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 1051 transitions. [2022-11-25 23:55:00,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1051 transitions. [2022-11-25 23:55:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:55:00,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:00,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:55:00,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:55:00,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1133952232, now seen corresponding path program 1 times [2022-11-25 23:55:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:00,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746261291] [2022-11-25 23:55:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:00,637 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-25 23:55:00,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746261291] [2022-11-25 23:55:00,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746261291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:00,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:00,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:55:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750409917] [2022-11-25 23:55:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:00,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:55:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:55:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:55:00,643 INFO L87 Difference]: Start difference. First operand 425 states and 1051 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:00,938 INFO L93 Difference]: Finished difference Result 580 states and 1394 transitions. [2022-11-25 23:55:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:55:00,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-25 23:55:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:00,941 INFO L225 Difference]: With dead ends: 580 [2022-11-25 23:55:00,941 INFO L226 Difference]: Without dead ends: 495 [2022-11-25 23:55:00,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:55:00,943 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:00,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:55:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-11-25 23:55:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 463. [2022-11-25 23:55:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 459 states have (on average 2.52723311546841) internal successors, (1160), 462 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1160 transitions. [2022-11-25 23:55:00,965 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1160 transitions. Word has length 6 [2022-11-25 23:55:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:00,966 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1160 transitions. [2022-11-25 23:55:00,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1160 transitions. [2022-11-25 23:55:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:55:00,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:00,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:55:00,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1636681417, now seen corresponding path program 1 times [2022-11-25 23:55:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:00,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393729422] [2022-11-25 23:55:00,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:00,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:01,132 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-25 23:55:01,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:01,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393729422] [2022-11-25 23:55:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393729422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:01,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:55:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992224465] [2022-11-25 23:55:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:55:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:55:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:55:01,141 INFO L87 Difference]: Start difference. First operand 463 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:01,217 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2022-11-25 23:55:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:55:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-25 23:55:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:01,219 INFO L225 Difference]: With dead ends: 143 [2022-11-25 23:55:01,219 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 23:55:01,219 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-25 23:55:01,220 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:01,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:55:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 23:55:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-25 23:55:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2022-11-25 23:55:01,225 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 10 [2022-11-25 23:55:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:01,228 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2022-11-25 23:55:01,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2022-11-25 23:55:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:01,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:01,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:55:01,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2133222575, now seen corresponding path program 1 times [2022-11-25 23:55:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:01,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562529899] [2022-11-25 23:55:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:04,708 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-25 23:55:04,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:04,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562529899] [2022-11-25 23:55:04,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562529899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:04,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:04,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441870384] [2022-11-25 23:55:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:04,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:04,710 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:05,915 INFO L93 Difference]: Finished difference Result 222 states and 473 transitions. [2022-11-25 23:55:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:55:05,918 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:05,919 INFO L225 Difference]: With dead ends: 222 [2022-11-25 23:55:05,919 INFO L226 Difference]: Without dead ends: 222 [2022-11-25 23:55:05,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:05,920 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:05,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:55:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-25 23:55:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2022-11-25 23:55:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.165680473372781) internal successors, (366), 170 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 366 transitions. [2022-11-25 23:55:05,927 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 366 transitions. Word has length 21 [2022-11-25 23:55:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:05,928 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 366 transitions. [2022-11-25 23:55:05,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 366 transitions. [2022-11-25 23:55:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:05,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:05,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:05,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:55:05,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2133222598, now seen corresponding path program 1 times [2022-11-25 23:55:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:05,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23476665] [2022-11-25 23:55:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:07,000 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-25 23:55:07,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:07,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23476665] [2022-11-25 23:55:07,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23476665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:07,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:07,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652052967] [2022-11-25 23:55:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:07,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:07,002 INFO L87 Difference]: Start difference. First operand 171 states and 366 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:07,424 INFO L93 Difference]: Finished difference Result 246 states and 496 transitions. [2022-11-25 23:55:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:07,426 INFO L225 Difference]: With dead ends: 246 [2022-11-25 23:55:07,427 INFO L226 Difference]: Without dead ends: 230 [2022-11-25 23:55:07,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:07,428 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:07,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:55:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-25 23:55:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 192. [2022-11-25 23:55:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.1526315789473682) internal successors, (409), 191 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 409 transitions. [2022-11-25 23:55:07,437 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 409 transitions. Word has length 21 [2022-11-25 23:55:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:07,438 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 409 transitions. [2022-11-25 23:55:07,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 409 transitions. [2022-11-25 23:55:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:07,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:07,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:07,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:55:07,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -872367349, now seen corresponding path program 2 times [2022-11-25 23:55:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:07,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268412670] [2022-11-25 23:55:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:09,598 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-25 23:55:09,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268412670] [2022-11-25 23:55:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268412670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:09,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282598096] [2022-11-25 23:55:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:09,600 INFO L87 Difference]: Start difference. First operand 192 states and 409 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:10,753 INFO L93 Difference]: Finished difference Result 292 states and 592 transitions. [2022-11-25 23:55:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:55:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:10,755 INFO L225 Difference]: With dead ends: 292 [2022-11-25 23:55:10,755 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 23:55:10,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:10,756 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:10,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:55:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 23:55:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2022-11-25 23:55:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.1344086021505375) internal successors, (397), 187 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 397 transitions. [2022-11-25 23:55:10,764 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 397 transitions. Word has length 21 [2022-11-25 23:55:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:10,765 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 397 transitions. [2022-11-25 23:55:10,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 397 transitions. [2022-11-25 23:55:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:10,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:10,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:10,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:55:10,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1040952973, now seen corresponding path program 3 times [2022-11-25 23:55:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:10,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861323272] [2022-11-25 23:55:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:13,288 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-25 23:55:13,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861323272] [2022-11-25 23:55:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861323272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:13,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434151622] [2022-11-25 23:55:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:13,291 INFO L87 Difference]: Start difference. First operand 188 states and 397 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:14,584 INFO L93 Difference]: Finished difference Result 284 states and 575 transitions. [2022-11-25 23:55:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:55:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:14,591 INFO L225 Difference]: With dead ends: 284 [2022-11-25 23:55:14,591 INFO L226 Difference]: Without dead ends: 259 [2022-11-25 23:55:14,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:14,593 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:14,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:55:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-25 23:55:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 210. [2022-11-25 23:55:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.0625) internal successors, (429), 209 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 429 transitions. [2022-11-25 23:55:14,602 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 429 transitions. Word has length 21 [2022-11-25 23:55:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:14,603 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 429 transitions. [2022-11-25 23:55:14,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 429 transitions. [2022-11-25 23:55:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:14,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:14,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:14,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:55:14,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1529830598, now seen corresponding path program 2 times [2022-11-25 23:55:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:14,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513509406] [2022-11-25 23:55:14,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:15,505 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-25 23:55:15,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:15,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513509406] [2022-11-25 23:55:15,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513509406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:15,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:15,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:15,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996562014] [2022-11-25 23:55:15,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:15,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:15,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:15,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:15,508 INFO L87 Difference]: Start difference. First operand 210 states and 429 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:15,790 INFO L93 Difference]: Finished difference Result 295 states and 568 transitions. [2022-11-25 23:55:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:15,792 INFO L225 Difference]: With dead ends: 295 [2022-11-25 23:55:15,792 INFO L226 Difference]: Without dead ends: 265 [2022-11-25 23:55:15,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:15,793 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:15,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 6 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-25 23:55:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 189. [2022-11-25 23:55:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 2.106951871657754) internal successors, (394), 188 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 394 transitions. [2022-11-25 23:55:15,805 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 394 transitions. Word has length 21 [2022-11-25 23:55:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:15,805 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 394 transitions. [2022-11-25 23:55:15,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 394 transitions. [2022-11-25 23:55:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:15,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:15,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:15,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:55:15,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1301123853, now seen corresponding path program 4 times [2022-11-25 23:55:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374273736] [2022-11-25 23:55:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:17,753 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-25 23:55:17,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374273736] [2022-11-25 23:55:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374273736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:17,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:17,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751594924] [2022-11-25 23:55:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:17,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:17,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:17,756 INFO L87 Difference]: Start difference. First operand 189 states and 394 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:18,874 INFO L93 Difference]: Finished difference Result 298 states and 592 transitions. [2022-11-25 23:55:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:55:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:18,876 INFO L225 Difference]: With dead ends: 298 [2022-11-25 23:55:18,877 INFO L226 Difference]: Without dead ends: 298 [2022-11-25 23:55:18,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:18,878 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:18,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:55:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-25 23:55:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 220. [2022-11-25 23:55:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 218 states have (on average 2.041284403669725) internal successors, (445), 219 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 445 transitions. [2022-11-25 23:55:18,886 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 445 transitions. Word has length 21 [2022-11-25 23:55:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:18,887 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 445 transitions. [2022-11-25 23:55:18,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 445 transitions. [2022-11-25 23:55:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:18,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:18,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:55:18,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1301123876, now seen corresponding path program 3 times [2022-11-25 23:55:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:18,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942467556] [2022-11-25 23:55:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:19,658 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-25 23:55:19,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:19,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942467556] [2022-11-25 23:55:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942467556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:19,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:19,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138207485] [2022-11-25 23:55:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:19,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:19,661 INFO L87 Difference]: Start difference. First operand 220 states and 445 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:20,025 INFO L93 Difference]: Finished difference Result 278 states and 539 transitions. [2022-11-25 23:55:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:20,027 INFO L225 Difference]: With dead ends: 278 [2022-11-25 23:55:20,027 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 23:55:20,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:20,028 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:20,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:55:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 23:55:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 172. [2022-11-25 23:55:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 2.123529411764706) internal successors, (361), 171 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 361 transitions. [2022-11-25 23:55:20,034 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 361 transitions. Word has length 21 [2022-11-25 23:55:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:20,035 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 361 transitions. [2022-11-25 23:55:20,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 361 transitions. [2022-11-25 23:55:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:20,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:20,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:20,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:55:20,036 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash 629805873, now seen corresponding path program 5 times [2022-11-25 23:55:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:20,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255319114] [2022-11-25 23:55:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:20,428 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-25 23:55:20,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:20,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255319114] [2022-11-25 23:55:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255319114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:20,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:55:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542503640] [2022-11-25 23:55:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:20,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:55:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:55:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:55:20,431 INFO L87 Difference]: Start difference. First operand 172 states and 361 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:20,509 INFO L93 Difference]: Finished difference Result 184 states and 371 transitions. [2022-11-25 23:55:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:55:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:20,511 INFO L225 Difference]: With dead ends: 184 [2022-11-25 23:55:20,511 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 23:55:20,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 23:55:20,511 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:20,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:55:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 23:55:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2022-11-25 23:55:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 2.0647058823529414) internal successors, (351), 171 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-25 23:55:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 351 transitions. [2022-11-25 23:55:20,517 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 351 transitions. Word has length 21 [2022-11-25 23:55:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:20,517 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 351 transitions. [2022-11-25 23:55:20,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 351 transitions. [2022-11-25 23:55:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:20,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:20,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:20,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:55:20,521 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1832422323, now seen corresponding path program 6 times [2022-11-25 23:55:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:20,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853242250] [2022-11-25 23:55:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:22,354 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-25 23:55:22,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:22,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853242250] [2022-11-25 23:55:22,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853242250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:22,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:22,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:55:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595387220] [2022-11-25 23:55:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:22,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:55:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:55:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:55:22,357 INFO L87 Difference]: Start difference. First operand 172 states and 351 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:23,058 INFO L93 Difference]: Finished difference Result 202 states and 395 transitions. [2022-11-25 23:55:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:55:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:23,060 INFO L225 Difference]: With dead ends: 202 [2022-11-25 23:55:23,060 INFO L226 Difference]: Without dead ends: 171 [2022-11-25 23:55:23,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:55:23,061 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:23,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:55:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-25 23:55:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-11-25 23:55:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.06508875739645) internal successors, (349), 170 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-25 23:55:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 349 transitions. [2022-11-25 23:55:23,068 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 349 transitions. Word has length 21 [2022-11-25 23:55:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:23,068 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 349 transitions. [2022-11-25 23:55:23,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 349 transitions. [2022-11-25 23:55:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:23,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:23,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:23,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:55:23,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1587585777, now seen corresponding path program 7 times [2022-11-25 23:55:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:23,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30580171] [2022-11-25 23:55:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:25,082 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-25 23:55:25,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:25,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30580171] [2022-11-25 23:55:25,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30580171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:25,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:25,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097305700] [2022-11-25 23:55:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:25,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:25,084 INFO L87 Difference]: Start difference. First operand 171 states and 349 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:26,223 INFO L93 Difference]: Finished difference Result 251 states and 489 transitions. [2022-11-25 23:55:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:55:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:26,225 INFO L225 Difference]: With dead ends: 251 [2022-11-25 23:55:26,225 INFO L226 Difference]: Without dead ends: 221 [2022-11-25 23:55:26,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:55:26,226 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:26,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:55:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-25 23:55:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2022-11-25 23:55:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.066265060240964) internal successors, (343), 167 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 343 transitions. [2022-11-25 23:55:26,233 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 343 transitions. Word has length 21 [2022-11-25 23:55:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:26,233 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 343 transitions. [2022-11-25 23:55:26,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 343 transitions. [2022-11-25 23:55:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:26,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:26,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:26,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:55:26,235 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash -867399007, now seen corresponding path program 8 times [2022-11-25 23:55:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:26,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092606907] [2022-11-25 23:55:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:28,221 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-25 23:55:28,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:28,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092606907] [2022-11-25 23:55:28,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092606907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:28,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:28,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194991226] [2022-11-25 23:55:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:28,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:28,225 INFO L87 Difference]: Start difference. First operand 168 states and 343 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:29,449 INFO L93 Difference]: Finished difference Result 241 states and 462 transitions. [2022-11-25 23:55:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:55:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:29,451 INFO L225 Difference]: With dead ends: 241 [2022-11-25 23:55:29,451 INFO L226 Difference]: Without dead ends: 204 [2022-11-25 23:55:29,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:29,452 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:29,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:55:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-25 23:55:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2022-11-25 23:55:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 2.069620253164557) internal successors, (327), 159 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 327 transitions. [2022-11-25 23:55:29,459 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 327 transitions. Word has length 21 [2022-11-25 23:55:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 327 transitions. [2022-11-25 23:55:29,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 327 transitions. [2022-11-25 23:55:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:29,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:29,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:29,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:55:29,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash 340908783, now seen corresponding path program 9 times [2022-11-25 23:55:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871313259] [2022-11-25 23:55:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:29,800 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-25 23:55:29,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871313259] [2022-11-25 23:55:29,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871313259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:29,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:29,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:55:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703474827] [2022-11-25 23:55:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:55:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:55:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:55:29,806 INFO L87 Difference]: Start difference. First operand 160 states and 327 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:29,880 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2022-11-25 23:55:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:55:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:29,881 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:55:29,882 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 23:55:29,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 23:55:29,882 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:29,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:55:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 23:55:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 23:55:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 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-25 23:55:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2022-11-25 23:55:29,885 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 21 [2022-11-25 23:55:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:29,885 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2022-11-25 23:55:29,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2022-11-25 23:55:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:29,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:29,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:29,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:55:29,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1439470513, now seen corresponding path program 10 times [2022-11-25 23:55:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324196487] [2022-11-25 23:55:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:31,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324196487] [2022-11-25 23:55:31,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324196487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:31,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786917239] [2022-11-25 23:55:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:31,667 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:32,324 INFO L93 Difference]: Finished difference Result 84 states and 119 transitions. [2022-11-25 23:55:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:32,325 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:55:32,325 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 23:55:32,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:32,326 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:32,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:55:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 23:55:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-25 23:55:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.451219512195122) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-11-25 23:55:32,330 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 21 [2022-11-25 23:55:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:32,330 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-11-25 23:55:32,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-11-25 23:55:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:32,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:32,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:32,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:55:32,331 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1439470490, now seen corresponding path program 4 times [2022-11-25 23:55:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:32,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686243098] [2022-11-25 23:55:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:33,063 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-25 23:55:33,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:33,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686243098] [2022-11-25 23:55:33,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686243098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:33,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:33,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909269319] [2022-11-25 23:55:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:33,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:33,065 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:33,327 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2022-11-25 23:55:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:33,328 INFO L225 Difference]: With dead ends: 93 [2022-11-25 23:55:33,328 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 23:55:33,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:33,329 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:33,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 11 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 23:55:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-11-25 23:55:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 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-25 23:55:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2022-11-25 23:55:33,331 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 21 [2022-11-25 23:55:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:33,332 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-11-25 23:55:33,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2022-11-25 23:55:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:33,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:33,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:55:33,333 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 245774391, now seen corresponding path program 11 times [2022-11-25 23:55:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951282358] [2022-11-25 23:55:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:34,986 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-25 23:55:34,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:34,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951282358] [2022-11-25 23:55:34,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951282358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:34,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:34,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151280453] [2022-11-25 23:55:34,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:34,989 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:35,879 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2022-11-25 23:55:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:35,880 INFO L225 Difference]: With dead ends: 87 [2022-11-25 23:55:35,880 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:55:35,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:35,881 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:35,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:55:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:55:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 23:55:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 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-25 23:55:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2022-11-25 23:55:35,885 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 21 [2022-11-25 23:55:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:35,885 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2022-11-25 23:55:35,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2022-11-25 23:55:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:35,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:35,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:35,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:55:35,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1108697773, now seen corresponding path program 12 times [2022-11-25 23:55:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:35,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766527113] [2022-11-25 23:55:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:37,523 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-25 23:55:37,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:37,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766527113] [2022-11-25 23:55:37,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766527113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:37,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:37,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322865725] [2022-11-25 23:55:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:37,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:37,525 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:38,225 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2022-11-25 23:55:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:38,226 INFO L225 Difference]: With dead ends: 83 [2022-11-25 23:55:38,226 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 23:55:38,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:38,227 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:38,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:55:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 23:55:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-25 23:55:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 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-25 23:55:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2022-11-25 23:55:38,231 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 21 [2022-11-25 23:55:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:38,231 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2022-11-25 23:55:38,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2022-11-25 23:55:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:38,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:38,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:38,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:55:38,233 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1108697750, now seen corresponding path program 5 times [2022-11-25 23:55:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609481936] [2022-11-25 23:55:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:38,859 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-25 23:55:38,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609481936] [2022-11-25 23:55:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609481936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715419146] [2022-11-25 23:55:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:38,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:38,860 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:39,109 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-11-25 23:55:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:39,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:39,110 INFO L225 Difference]: With dead ends: 92 [2022-11-25 23:55:39,111 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 23:55:39,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:39,111 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:39,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 23:55:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-11-25 23:55:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-11-25 23:55:39,115 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 21 [2022-11-25 23:55:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:39,115 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-11-25 23:55:39,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-11-25 23:55:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:39,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:39,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:55:39,116 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1360533827, now seen corresponding path program 13 times [2022-11-25 23:55:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742984231] [2022-11-25 23:55:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:40,759 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-25 23:55:40,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:40,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742984231] [2022-11-25 23:55:40,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742984231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:40,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609521808] [2022-11-25 23:55:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:40,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:40,761 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:41,494 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2022-11-25 23:55:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:41,496 INFO L225 Difference]: With dead ends: 91 [2022-11-25 23:55:41,496 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:55:41,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:41,497 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:41,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:55:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:55:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-11-25 23:55:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-11-25 23:55:41,500 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 21 [2022-11-25 23:55:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:41,500 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-11-25 23:55:41,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-11-25 23:55:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:41,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:41,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:41,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:55:41,513 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1360533804, now seen corresponding path program 6 times [2022-11-25 23:55:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:41,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100445304] [2022-11-25 23:55:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:42,120 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-25 23:55:42,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100445304] [2022-11-25 23:55:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100445304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:42,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:42,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:55:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311687199] [2022-11-25 23:55:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:42,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:55:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:55:42,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:55:42,122 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:42,368 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2022-11-25 23:55:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:55:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:42,369 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:55:42,369 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 23:55:42,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:55:42,370 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:42,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 23:55:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-11-25 23:55:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2022-11-25 23:55:42,373 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 21 [2022-11-25 23:55:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:42,374 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2022-11-25 23:55:42,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2022-11-25 23:55:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:42,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:42,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:42,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:55:42,375 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1671739391, now seen corresponding path program 14 times [2022-11-25 23:55:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:42,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002924686] [2022-11-25 23:55:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:43,724 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-25 23:55:43,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:43,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002924686] [2022-11-25 23:55:43,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002924686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:43,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:43,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193846708] [2022-11-25 23:55:43,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:43,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:43,726 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:44,398 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-11-25 23:55:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:44,399 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:55:44,399 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 23:55:44,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:44,400 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:44,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:55:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 23:55:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-25 23:55:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2022-11-25 23:55:44,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 21 [2022-11-25 23:55:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:44,402 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2022-11-25 23:55:44,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-11-25 23:55:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:44,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:44,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:44,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:55:44,403 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2131205425, now seen corresponding path program 15 times [2022-11-25 23:55:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977014679] [2022-11-25 23:55:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:45,791 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-25 23:55:45,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977014679] [2022-11-25 23:55:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977014679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:45,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618944360] [2022-11-25 23:55:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:45,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:45,794 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:46,505 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-11-25 23:55:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:46,506 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:55:46,507 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 23:55:46,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:46,508 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:46,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:55:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 23:55:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 23:55:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 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-25 23:55:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-11-25 23:55:46,511 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-11-25 23:55:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:46,511 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-11-25 23:55:46,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-11-25 23:55:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:46,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:46,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:46,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 23:55:46,513 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1046779423, now seen corresponding path program 16 times [2022-11-25 23:55:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843259300] [2022-11-25 23:55:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:48,012 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-25 23:55:48,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843259300] [2022-11-25 23:55:48,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843259300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:48,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:48,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112420141] [2022-11-25 23:55:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:48,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:48,014 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:48,684 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-11-25 23:55:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:48,685 INFO L225 Difference]: With dead ends: 51 [2022-11-25 23:55:48,685 INFO L226 Difference]: Without dead ends: 22 [2022-11-25 23:55:48,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:48,686 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:48,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:55:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-25 23:55:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-25 23:55:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-11-25 23:55:48,688 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 21 [2022-11-25 23:55:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:48,689 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-11-25 23:55:48,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-11-25 23:55:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:55:48,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:48,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:48,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:55:48,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-25 23:55:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 478115663, now seen corresponding path program 17 times [2022-11-25 23:55:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:48,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924226221] [2022-11-25 23:55:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:49,987 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-25 23:55:49,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924226221] [2022-11-25 23:55:49,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924226221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:55:49,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:55:49,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:55:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391064085] [2022-11-25 23:55:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:55:49,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:55:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:55:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:55:49,989 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:50,504 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-25 23:55:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:55:50,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:55:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:50,505 INFO L225 Difference]: With dead ends: 21 [2022-11-25 23:55:50,505 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:55:50,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:55:50,506 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:50,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:55:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:55:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:55:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:55:50,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-25 23:55:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:50,508 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:55:50,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:55:50,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:55:50,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-11-25 23:55:50,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-11-25 23:55:50,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-11-25 23:55:50,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-11-25 23:55:50,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-11-25 23:55:50,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-11-25 23:55:50,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-11-25 23:55:50,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-11-25 23:55:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:55:50,517 INFO L445 BasicCegarLoop]: Path program histogram: [17, 6, 1, 1, 1, 1] [2022-11-25 23:55:50,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:55:50,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:55:50,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:55:50 BasicIcfg [2022-11-25 23:55:50,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:55:50,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:55:50,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:55:50,525 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:55:50,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:53:56" (3/4) ... [2022-11-25 23:55:50,528 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:55:50,534 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2022-11-25 23:55:50,539 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-25 23:55:50,539 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:55:50,539 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 23:55:50,539 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:55:50,576 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:55:50,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:55:50,576 INFO L158 Benchmark]: Toolchain (without parser) took 116217.22ms. Allocated memory was 172.0MB in the beginning and 650.1MB in the end (delta: 478.2MB). Free memory was 135.1MB in the beginning and 525.6MB in the end (delta: -390.5MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,577 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:55:50,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1338.70ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 77.8MB in the end (delta: 57.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.15ms. Allocated memory is still 172.0MB. Free memory was 77.8MB in the beginning and 75.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,578 INFO L158 Benchmark]: Boogie Preprocessor took 85.28ms. Allocated memory is still 172.0MB. Free memory was 75.1MB in the beginning and 72.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,578 INFO L158 Benchmark]: RCFGBuilder took 840.42ms. Allocated memory is still 172.0MB. Free memory was 72.3MB in the beginning and 126.8MB in the end (delta: -54.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,579 INFO L158 Benchmark]: TraceAbstraction took 113785.52ms. Allocated memory was 172.0MB in the beginning and 650.1MB in the end (delta: 478.2MB). Free memory was 125.7MB in the beginning and 529.8MB in the end (delta: -404.1MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,579 INFO L158 Benchmark]: Witness Printer took 51.81ms. Allocated memory is still 650.1MB. Free memory was 529.8MB in the beginning and 525.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:55:50,581 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1338.70ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 77.8MB in the end (delta: 57.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.15ms. Allocated memory is still 172.0MB. Free memory was 77.8MB in the beginning and 75.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.28ms. Allocated memory is still 172.0MB. Free memory was 75.1MB in the beginning and 72.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 840.42ms. Allocated memory is still 172.0MB. Free memory was 72.3MB in the beginning and 126.8MB in the end (delta: -54.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 113785.52ms. Allocated memory was 172.0MB in the beginning and 650.1MB in the end (delta: 478.2MB). Free memory was 125.7MB in the beginning and 529.8MB in the end (delta: -404.1MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 51.81ms. Allocated memory is still 650.1MB. Free memory was 529.8MB in the beginning and 525.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.9s, 192 PlacesBefore, 40 PlacesAfterwards, 194 TransitionsBefore, 37 TransitionsAfterwards, 3224 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 23 ConcurrentYvCompositions, 5 ChoiceCompositions, 219 TotalNumberOfCompositions, 7205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3383, independent: 3146, independent conditional: 0, independent unconditional: 3146, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2243, independent: 2181, independent conditional: 0, independent unconditional: 2181, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2243, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40182, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 344, dependent conditional: 0, dependent unconditional: 344, unknown: 39786, unknown conditional: 0, unknown unconditional: 39786] ], Cache Queries: [ total: 3383, independent: 965, independent conditional: 0, independent unconditional: 965, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 2301, unknown conditional: 0, unknown unconditional: 2301] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 202 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 113.6s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 62.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 811 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7527 IncrementalHoareTripleChecker+Invalid, 7758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 66 mSDtfsCounter, 7527 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=3, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 702 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 10586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 23:55:50,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d44fdc80-4c3d-46ba-ab49-868dd3f785d5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE