./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8 --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 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:53:02,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:53:02,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:53:02,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:53:02,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:53:02,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:53:02,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:53:02,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:53:02,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:53:02,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:53:02,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:53:02,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:53:02,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:53:02,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:53:02,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:53:02,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:53:02,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:53:02,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:53:02,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:53:02,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:53:02,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:53:02,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:53:02,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:53:02,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:53:02,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:53:02,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:53:02,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:53:02,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:53:02,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:53:02,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:53:02,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:53:02,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:53:02,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:53:02,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:53:02,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:53:02,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:53:02,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:53:02,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:53:02,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:53:02,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:53:02,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:53:02,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:53:02,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:53:02,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:53:02,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:53:02,350 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:53:02,351 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:53:02,351 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:53:02,351 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:53:02,351 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:53:02,351 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:53:02,352 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:53:02,353 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:53:02,353 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:53:02,353 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:53:02,353 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:53:02,354 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:53:02,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:53:02,355 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:53:02,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:53:02,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:53:02,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:53:02,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:53:02,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:53:02,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:53:02,356 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:53:02,356 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:53:02,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:53:02,357 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:53:02,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:53:02,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:53:02,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:53:02,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:53:02,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:53:02,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:53:02,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:53:02,360 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:53:02,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:53:02,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:53:02,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:53:02,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:53:02,361 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/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_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8 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 -> 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 [2021-10-13 07:53:02,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:53:02,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:53:02,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:53:02,707 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:53:02,708 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:53:02,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-13 07:53:02,774 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/data/33699089d/ce715a0a44474ce3b0a18c64fbb4c658/FLAG2cc80a728 [2021-10-13 07:53:03,398 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:53:03,399 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-13 07:53:03,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/data/33699089d/ce715a0a44474ce3b0a18c64fbb4c658/FLAG2cc80a728 [2021-10-13 07:53:03,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/data/33699089d/ce715a0a44474ce3b0a18c64fbb4c658 [2021-10-13 07:53:03,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:53:03,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:53:03,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:53:03,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:53:03,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:53:03,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:53:03" (1/1) ... [2021-10-13 07:53:03,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d42b659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:03, skipping insertion in model container [2021-10-13 07:53:03,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:53:03" (1/1) ... [2021-10-13 07:53:03,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:53:03,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:53:04,003 WARN L228 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_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-13 07:53:04,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:53:04,186 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:53:04,217 WARN L228 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_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-13 07:53:04,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:53:04,320 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:53:04,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04 WrapperNode [2021-10-13 07:53:04,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:53:04,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:53:04,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:53:04,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:53:04,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:53:04,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:53:04,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:53:04,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:53:04,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:53:04,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:53:04,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:53:04,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:53:04,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (1/1) ... [2021-10-13 07:53:04,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:53:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:53:04,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:53:04,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:53:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:53:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:53:04,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:53:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:53:04,926 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,937 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,944 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,947 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,949 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,956 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,959 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,964 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,966 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,966 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,971 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,976 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,980 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,982 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,984 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,987 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,992 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,994 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,996 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:04,998 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:05,000 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:05,002 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:05,002 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:05,004 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:53:06,049 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-13 07:53:06,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-13 07:53:06,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-13 07:53:06,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-13 07:53:06,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-13 07:53:06,053 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-13 07:53:06,053 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-13 07:53:06,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-13 07:53:06,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-13 07:53:06,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-13 07:53:06,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-13 07:53:06,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-13 07:53:06,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-13 07:53:06,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-13 07:53:06,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-13 07:53:06,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-13 07:53:06,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-13 07:53:06,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 07:53:06,057 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 07:53:06,057 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-13 07:53:06,058 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-13 07:53:06,058 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-13 07:53:06,058 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-13 07:53:06,059 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-13 07:53:06,059 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-13 07:53:06,060 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-13 07:53:06,060 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-13 07:53:06,060 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-13 07:53:06,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-13 07:53:06,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-13 07:53:06,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-13 07:53:06,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-13 07:53:06,062 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-13 07:53:06,062 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-13 07:53:06,062 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-13 07:53:06,068 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-13 07:53:06,068 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-13 07:53:06,068 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-13 07:53:06,068 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-13 07:53:06,068 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-13 07:53:06,069 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-13 07:53:06,069 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-13 07:53:06,069 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-13 07:53:06,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:53:06,972 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-10-13 07:53:06,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:53:06 BoogieIcfgContainer [2021-10-13 07:53:06,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:53:06,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:53:06,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:53:06,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:53:06,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:53:03" (1/3) ... [2021-10-13 07:53:06,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120e45a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:53:06, skipping insertion in model container [2021-10-13 07:53:06,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:04" (2/3) ... [2021-10-13 07:53:06,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120e45a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:53:06, skipping insertion in model container [2021-10-13 07:53:06,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:53:06" (3/3) ... [2021-10-13 07:53:06,988 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2021-10-13 07:53:06,994 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:53:06,995 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-10-13 07:53:07,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:53:07,052 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:53:07,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-10-13 07:53:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 257 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:53:07,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:07,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:07,088 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -510467847, now seen corresponding path program 1 times [2021-10-13 07:53:07,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:07,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196837057] [2021-10-13 07:53:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:07,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:07,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:07,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196837057] [2021-10-13 07:53:07,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196837057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:07,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:07,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:07,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021353370] [2021-10-13 07:53:07,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:07,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,332 INFO L87 Difference]: Start difference. First operand has 258 states, 216 states have (on average 1.7777777777777777) internal successors, (384), 257 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:07,535 INFO L93 Difference]: Finished difference Result 486 states and 724 transitions. [2021-10-13 07:53:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-13 07:53:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:07,549 INFO L225 Difference]: With dead ends: 486 [2021-10-13 07:53:07,550 INFO L226 Difference]: Without dead ends: 259 [2021-10-13 07:53:07,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-13 07:53:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-10-13 07:53:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 230 states have (on average 1.491304347826087) internal successors, (343), 258 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) [2021-10-13 07:53:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 343 transitions. [2021-10-13 07:53:07,608 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 343 transitions. Word has length 7 [2021-10-13 07:53:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:07,608 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 343 transitions. [2021-10-13 07:53:07,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 343 transitions. [2021-10-13 07:53:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:53:07,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:07,610 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:07,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:53:07,611 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -873900632, now seen corresponding path program 1 times [2021-10-13 07:53:07,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:07,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259729858] [2021-10-13 07:53:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:07,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:07,686 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:07,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259729858] [2021-10-13 07:53:07,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259729858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:07,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:07,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:07,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777388161] [2021-10-13 07:53:07,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:07,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,690 INFO L87 Difference]: Start difference. First operand 259 states and 343 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:07,739 INFO L93 Difference]: Finished difference Result 481 states and 629 transitions. [2021-10-13 07:53:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-10-13 07:53:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:07,742 INFO L225 Difference]: With dead ends: 481 [2021-10-13 07:53:07,743 INFO L226 Difference]: Without dead ends: 336 [2021-10-13 07:53:07,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-13 07:53:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 247. [2021-10-13 07:53:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 246 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2021-10-13 07:53:07,764 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 9 [2021-10-13 07:53:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:07,764 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2021-10-13 07:53:07,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2021-10-13 07:53:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:53:07,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:07,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:07,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:53:07,766 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash 765253587, now seen corresponding path program 1 times [2021-10-13 07:53:07,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:07,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329351307] [2021-10-13 07:53:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:07,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:07,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:07,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329351307] [2021-10-13 07:53:07,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329351307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:07,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:07,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:53:07,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487486220] [2021-10-13 07:53:07,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:07,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,810 INFO L87 Difference]: Start difference. First operand 247 states and 326 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2021-10-13 07:53:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:07,828 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-10-13 07:53:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 [2021-10-13 07:53:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:07,831 INFO L225 Difference]: With dead ends: 269 [2021-10-13 07:53:07,831 INFO L226 Difference]: Without dead ends: 247 [2021-10-13 07:53:07,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-13 07:53:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-10-13 07:53:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 246 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 325 transitions. [2021-10-13 07:53:07,848 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 325 transitions. Word has length 10 [2021-10-13 07:53:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:07,848 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 325 transitions. [2021-10-13 07:53:07,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2021-10-13 07:53:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 325 transitions. [2021-10-13 07:53:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:53:07,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:07,850 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:07,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:53:07,850 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1366602656, now seen corresponding path program 1 times [2021-10-13 07:53:07,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:07,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420343944] [2021-10-13 07:53:07,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:07,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:07,904 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:07,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420343944] [2021-10-13 07:53:07,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420343944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:07,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:07,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:07,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720815147] [2021-10-13 07:53:07,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:07,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,907 INFO L87 Difference]: Start difference. First operand 247 states and 325 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:07,940 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2021-10-13 07:53:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:07,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-13 07:53:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:07,943 INFO L225 Difference]: With dead ends: 307 [2021-10-13 07:53:07,943 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 07:53:07,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 07:53:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 271. [2021-10-13 07:53:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 251 states have (on average 1.4342629482071714) internal successors, (360), 270 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2021-10-13 07:53:07,967 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 13 [2021-10-13 07:53:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:07,968 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2021-10-13 07:53:07,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2021-10-13 07:53:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:53:07,974 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:07,975 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:07,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:53:07,977 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -897998562, now seen corresponding path program 1 times [2021-10-13 07:53:07,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:07,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454099129] [2021-10-13 07:53:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:07,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:08,079 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:08,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454099129] [2021-10-13 07:53:08,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454099129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:08,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:08,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:53:08,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174825915] [2021-10-13 07:53:08,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:08,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:08,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:08,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:08,082 INFO L87 Difference]: Start difference. First operand 271 states and 360 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:08,116 INFO L93 Difference]: Finished difference Result 337 states and 429 transitions. [2021-10-13 07:53:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:53:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-13 07:53:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:08,119 INFO L225 Difference]: With dead ends: 337 [2021-10-13 07:53:08,119 INFO L226 Difference]: Without dead ends: 301 [2021-10-13 07:53:08,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-13 07:53:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2021-10-13 07:53:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 238 states have (on average 1.4243697478991597) internal successors, (339), 257 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2021-10-13 07:53:08,134 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 16 [2021-10-13 07:53:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:08,135 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2021-10-13 07:53:08,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2021-10-13 07:53:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:53:08,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:08,136 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:08,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:53:08,137 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:08,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1711216500, now seen corresponding path program 1 times [2021-10-13 07:53:08,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:08,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339637721] [2021-10-13 07:53:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:08,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:08,195 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:08,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339637721] [2021-10-13 07:53:08,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339637721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:08,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:08,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:08,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651062607] [2021-10-13 07:53:08,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:08,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,201 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:08,337 INFO L93 Difference]: Finished difference Result 289 states and 377 transitions. [2021-10-13 07:53:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-13 07:53:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:08,341 INFO L225 Difference]: With dead ends: 289 [2021-10-13 07:53:08,341 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 07:53:08,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 07:53:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2021-10-13 07:53:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 261 states have (on average 1.4137931034482758) internal successors, (369), 280 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2021-10-13 07:53:08,356 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 16 [2021-10-13 07:53:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:08,357 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2021-10-13 07:53:08,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2021-10-13 07:53:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:53:08,359 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:08,359 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:08,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:53:08,359 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 274723131, now seen corresponding path program 1 times [2021-10-13 07:53:08,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:08,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115290863] [2021-10-13 07:53:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:08,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:08,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:08,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115290863] [2021-10-13 07:53:08,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115290863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:08,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:08,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:08,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674655487] [2021-10-13 07:53:08,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:08,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,447 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:08,566 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2021-10-13 07:53:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 07:53:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:08,574 INFO L225 Difference]: With dead ends: 381 [2021-10-13 07:53:08,575 INFO L226 Difference]: Without dead ends: 278 [2021-10-13 07:53:08,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-13 07:53:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-10-13 07:53:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 260 states have (on average 1.4038461538461537) internal successors, (365), 277 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 365 transitions. [2021-10-13 07:53:08,594 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 365 transitions. Word has length 17 [2021-10-13 07:53:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:08,595 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 365 transitions. [2021-10-13 07:53:08,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 365 transitions. [2021-10-13 07:53:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:53:08,596 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:08,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:08,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:53:08,597 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 846281230, now seen corresponding path program 1 times [2021-10-13 07:53:08,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:08,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288845821] [2021-10-13 07:53:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:08,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:08,654 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:08,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288845821] [2021-10-13 07:53:08,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288845821] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:08,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:08,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:08,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845137344] [2021-10-13 07:53:08,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:08,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,657 INFO L87 Difference]: Start difference. First operand 278 states and 365 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:08,765 INFO L93 Difference]: Finished difference Result 278 states and 365 transitions. [2021-10-13 07:53:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 07:53:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:08,768 INFO L225 Difference]: With dead ends: 278 [2021-10-13 07:53:08,768 INFO L226 Difference]: Without dead ends: 266 [2021-10-13 07:53:08,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-13 07:53:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-13 07:53:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 254 states have (on average 1.389763779527559) internal successors, (353), 265 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2021-10-13 07:53:08,784 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 17 [2021-10-13 07:53:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:08,785 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2021-10-13 07:53:08,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2021-10-13 07:53:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:53:08,786 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:08,786 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:08,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:53:08,787 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1525683153, now seen corresponding path program 1 times [2021-10-13 07:53:08,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:08,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655822988] [2021-10-13 07:53:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:08,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:08,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:08,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655822988] [2021-10-13 07:53:08,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655822988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:08,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:08,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:08,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105489167] [2021-10-13 07:53:08,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:08,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:08,867 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,022 INFO L93 Difference]: Finished difference Result 278 states and 363 transitions. [2021-10-13 07:53:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 07:53:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,024 INFO L225 Difference]: With dead ends: 278 [2021-10-13 07:53:09,024 INFO L226 Difference]: Without dead ends: 269 [2021-10-13 07:53:09,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-10-13 07:53:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2021-10-13 07:53:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 254 states have (on average 1.3818897637795275) internal successors, (351), 265 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) [2021-10-13 07:53:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2021-10-13 07:53:09,042 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 17 [2021-10-13 07:53:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,043 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2021-10-13 07:53:09,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2021-10-13 07:53:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 07:53:09,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,044 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:53:09,045 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1981549689, now seen corresponding path program 1 times [2021-10-13 07:53:09,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087768440] [2021-10-13 07:53:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,076 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087768440] [2021-10-13 07:53:09,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087768440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:09,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82878759] [2021-10-13 07:53:09,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:09,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:09,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,078 INFO L87 Difference]: Start difference. First operand 266 states and 351 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,111 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2021-10-13 07:53:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:09,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-13 07:53:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,114 INFO L225 Difference]: With dead ends: 359 [2021-10-13 07:53:09,114 INFO L226 Difference]: Without dead ends: 264 [2021-10-13 07:53:09,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-13 07:53:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2021-10-13 07:53:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 238 states have (on average 1.361344537815126) internal successors, (324), 249 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 324 transitions. [2021-10-13 07:53:09,132 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 324 transitions. Word has length 18 [2021-10-13 07:53:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,133 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 324 transitions. [2021-10-13 07:53:09,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 324 transitions. [2021-10-13 07:53:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 07:53:09,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:53:09,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash -481424925, now seen corresponding path program 1 times [2021-10-13 07:53:09,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695173973] [2021-10-13 07:53:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695173973] [2021-10-13 07:53:09,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695173973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:09,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90785277] [2021-10-13 07:53:09,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:09,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:09,196 INFO L87 Difference]: Start difference. First operand 250 states and 324 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,344 INFO L93 Difference]: Finished difference Result 262 states and 334 transitions. [2021-10-13 07:53:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-13 07:53:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,348 INFO L225 Difference]: With dead ends: 262 [2021-10-13 07:53:09,348 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 07:53:09,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 07:53:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2021-10-13 07:53:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 238 states have (on average 1.3529411764705883) internal successors, (322), 249 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2021-10-13 07:53:09,368 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 18 [2021-10-13 07:53:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,368 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2021-10-13 07:53:09,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2021-10-13 07:53:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:53:09,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,369 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:53:09,371 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1492059418, now seen corresponding path program 1 times [2021-10-13 07:53:09,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55028928] [2021-10-13 07:53:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55028928] [2021-10-13 07:53:09,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55028928] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:09,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7745136] [2021-10-13 07:53:09,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:09,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,413 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,540 INFO L93 Difference]: Finished difference Result 324 states and 411 transitions. [2021-10-13 07:53:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:53:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,543 INFO L225 Difference]: With dead ends: 324 [2021-10-13 07:53:09,543 INFO L226 Difference]: Without dead ends: 316 [2021-10-13 07:53:09,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-13 07:53:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2021-10-13 07:53:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 257 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2021-10-13 07:53:09,564 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 19 [2021-10-13 07:53:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,565 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2021-10-13 07:53:09,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2021-10-13 07:53:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:53:09,566 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,566 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:53:09,566 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1891738440, now seen corresponding path program 1 times [2021-10-13 07:53:09,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587776726] [2021-10-13 07:53:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587776726] [2021-10-13 07:53:09,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587776726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:53:09,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862795051] [2021-10-13 07:53:09,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:09,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:09,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:09,603 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,645 INFO L93 Difference]: Finished difference Result 271 states and 346 transitions. [2021-10-13 07:53:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:53:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,667 INFO L225 Difference]: With dead ends: 271 [2021-10-13 07:53:09,667 INFO L226 Difference]: Without dead ends: 256 [2021-10-13 07:53:09,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-13 07:53:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-13 07:53:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 244 states have (on average 1.3565573770491803) internal successors, (331), 255 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2021-10-13 07:53:09,686 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 19 [2021-10-13 07:53:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,686 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2021-10-13 07:53:09,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2021-10-13 07:53:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:53:09,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:53:09,688 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 983139277, now seen corresponding path program 1 times [2021-10-13 07:53:09,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084326354] [2021-10-13 07:53:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084326354] [2021-10-13 07:53:09,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084326354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:09,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973639810] [2021-10-13 07:53:09,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:09,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,729 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:09,764 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2021-10-13 07:53:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 07:53:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:09,767 INFO L225 Difference]: With dead ends: 373 [2021-10-13 07:53:09,767 INFO L226 Difference]: Without dead ends: 279 [2021-10-13 07:53:09,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-13 07:53:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2021-10-13 07:53:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 235 states have (on average 1.3319148936170213) internal successors, (313), 243 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2021-10-13 07:53:09,788 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 20 [2021-10-13 07:53:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:09,788 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2021-10-13 07:53:09,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2021-10-13 07:53:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:53:09,790 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:09,790 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:09,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:53:09,791 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1221054761, now seen corresponding path program 1 times [2021-10-13 07:53:09,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:09,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478534078] [2021-10-13 07:53:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:09,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:09,866 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:09,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478534078] [2021-10-13 07:53:09,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478534078] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:09,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:09,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:09,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699087051] [2021-10-13 07:53:09,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:09,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:09,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:09,869 INFO L87 Difference]: Start difference. First operand 244 states and 313 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:10,019 INFO L93 Difference]: Finished difference Result 279 states and 354 transitions. [2021-10-13 07:53:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:10,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 07:53:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:10,022 INFO L225 Difference]: With dead ends: 279 [2021-10-13 07:53:10,023 INFO L226 Difference]: Without dead ends: 239 [2021-10-13 07:53:10,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-10-13 07:53:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-10-13 07:53:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 231 states have (on average 1.3203463203463204) internal successors, (305), 238 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2021-10-13 07:53:10,047 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 20 [2021-10-13 07:53:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:10,048 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2021-10-13 07:53:10,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2021-10-13 07:53:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:53:10,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:10,051 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:10,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:53:10,052 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2081358437, now seen corresponding path program 1 times [2021-10-13 07:53:10,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:10,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001324837] [2021-10-13 07:53:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:10,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:10,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:10,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001324837] [2021-10-13 07:53:10,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001324837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:10,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:10,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:10,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824303006] [2021-10-13 07:53:10,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:10,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:10,213 INFO L87 Difference]: Start difference. First operand 239 states and 305 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) [2021-10-13 07:53:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:10,268 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2021-10-13 07:53:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:10,269 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 [2021-10-13 07:53:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:10,271 INFO L225 Difference]: With dead ends: 339 [2021-10-13 07:53:10,271 INFO L226 Difference]: Without dead ends: 241 [2021-10-13 07:53:10,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-13 07:53:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2021-10-13 07:53:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 226 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2021-10-13 07:53:10,296 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 21 [2021-10-13 07:53:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:10,297 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2021-10-13 07:53:10,297 INFO L471 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) [2021-10-13 07:53:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2021-10-13 07:53:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:53:10,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:10,298 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:10,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:53:10,298 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2014999082, now seen corresponding path program 1 times [2021-10-13 07:53:10,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:10,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979082163] [2021-10-13 07:53:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:10,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:10,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:10,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979082163] [2021-10-13 07:53:10,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979082163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:10,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:10,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:10,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522158218] [2021-10-13 07:53:10,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:10,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:10,380 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:10,534 INFO L93 Difference]: Finished difference Result 342 states and 427 transitions. [2021-10-13 07:53:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:10,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 07:53:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:10,537 INFO L225 Difference]: With dead ends: 342 [2021-10-13 07:53:10,537 INFO L226 Difference]: Without dead ends: 256 [2021-10-13 07:53:10,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-13 07:53:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-10-13 07:53:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.290909090909091) internal successors, (284), 226 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-10-13 07:53:10,569 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 22 [2021-10-13 07:53:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:10,569 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-10-13 07:53:10,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-10-13 07:53:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:53:10,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:10,570 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:10,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:53:10,571 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1370270137, now seen corresponding path program 1 times [2021-10-13 07:53:10,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:10,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778599737] [2021-10-13 07:53:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:10,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:10,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:10,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778599737] [2021-10-13 07:53:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778599737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:10,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:10,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:53:10,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875045647] [2021-10-13 07:53:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:53:10,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:53:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:10,670 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:10,941 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2021-10-13 07:53:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:53:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:53:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:10,945 INFO L225 Difference]: With dead ends: 303 [2021-10-13 07:53:10,945 INFO L226 Difference]: Without dead ends: 299 [2021-10-13 07:53:10,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-13 07:53:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 227. [2021-10-13 07:53:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.290909090909091) internal successors, (284), 226 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-10-13 07:53:10,972 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 23 [2021-10-13 07:53:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:10,972 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-10-13 07:53:10,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-10-13 07:53:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:53:10,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:10,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:10,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:53:10,974 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1831218950, now seen corresponding path program 1 times [2021-10-13 07:53:10,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:10,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097734585] [2021-10-13 07:53:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:10,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:11,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:11,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097734585] [2021-10-13 07:53:11,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097734585] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:11,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:11,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:11,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009884140] [2021-10-13 07:53:11,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:11,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:11,025 INFO L87 Difference]: Start difference. First operand 227 states and 284 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:11,166 INFO L93 Difference]: Finished difference Result 299 states and 367 transitions. [2021-10-13 07:53:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:53:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:11,168 INFO L225 Difference]: With dead ends: 299 [2021-10-13 07:53:11,168 INFO L226 Difference]: Without dead ends: 256 [2021-10-13 07:53:11,168 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-13 07:53:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-10-13 07:53:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 226 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2021-10-13 07:53:11,196 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 24 [2021-10-13 07:53:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:11,196 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2021-10-13 07:53:11,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2021-10-13 07:53:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:53:11,197 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:11,197 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:11,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:53:11,198 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -867731228, now seen corresponding path program 1 times [2021-10-13 07:53:11,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:11,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740225883] [2021-10-13 07:53:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:11,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:11,254 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:11,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740225883] [2021-10-13 07:53:11,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740225883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:11,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:11,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:11,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035861293] [2021-10-13 07:53:11,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:11,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:11,256 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:11,372 INFO L93 Difference]: Finished difference Result 270 states and 328 transitions. [2021-10-13 07:53:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:11,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:53:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:11,374 INFO L225 Difference]: With dead ends: 270 [2021-10-13 07:53:11,374 INFO L226 Difference]: Without dead ends: 227 [2021-10-13 07:53:11,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-13 07:53:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-10-13 07:53:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-10-13 07:53:11,401 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-10-13 07:53:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:11,401 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-10-13 07:53:11,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-10-13 07:53:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:53:11,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:11,402 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:11,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 07:53:11,403 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1729621359, now seen corresponding path program 1 times [2021-10-13 07:53:11,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:11,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811361267] [2021-10-13 07:53:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:11,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:11,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:11,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811361267] [2021-10-13 07:53:11,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811361267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:11,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:11,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:53:11,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803295149] [2021-10-13 07:53:11,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:53:11,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:53:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:11,487 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:11,668 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-10-13 07:53:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:53:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:53:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:11,670 INFO L225 Difference]: With dead ends: 247 [2021-10-13 07:53:11,671 INFO L226 Difference]: Without dead ends: 245 [2021-10-13 07:53:11,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-13 07:53:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-10-13 07:53:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-10-13 07:53:11,695 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-10-13 07:53:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:11,697 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-10-13 07:53:11,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-10-13 07:53:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:53:11,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:11,698 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:11,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:53:11,699 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash -890782658, now seen corresponding path program 1 times [2021-10-13 07:53:11,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:11,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776232055] [2021-10-13 07:53:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:11,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:11,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:11,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776232055] [2021-10-13 07:53:11,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776232055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:11,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:11,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:53:11,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363164112] [2021-10-13 07:53:11,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:53:11,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:53:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:11,757 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:11,826 INFO L93 Difference]: Finished difference Result 245 states and 289 transitions. [2021-10-13 07:53:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:53:11,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:53:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:11,828 INFO L225 Difference]: With dead ends: 245 [2021-10-13 07:53:11,829 INFO L226 Difference]: Without dead ends: 228 [2021-10-13 07:53:11,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:53:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-13 07:53:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-10-13 07:53:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.224770642201835) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-10-13 07:53:11,855 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 26 [2021-10-13 07:53:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:11,855 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-10-13 07:53:11,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-10-13 07:53:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:53:11,856 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:11,856 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:11,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 07:53:11,857 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1630670027, now seen corresponding path program 1 times [2021-10-13 07:53:11,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:11,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588559285] [2021-10-13 07:53:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:11,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:11,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:11,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588559285] [2021-10-13 07:53:11,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588559285] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:11,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:11,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:11,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083886845] [2021-10-13 07:53:11,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:11,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:11,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:11,886 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:11,970 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2021-10-13 07:53:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:11,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:53:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:11,972 INFO L225 Difference]: With dead ends: 245 [2021-10-13 07:53:11,972 INFO L226 Difference]: Without dead ends: 224 [2021-10-13 07:53:11,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-13 07:53:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-10-13 07:53:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 212 states have (on average 1.1981132075471699) internal successors, (254), 217 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2021-10-13 07:53:12,024 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 26 [2021-10-13 07:53:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,024 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2021-10-13 07:53:12,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2021-10-13 07:53:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:53:12,025 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,025 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 07:53:12,025 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash -778334719, now seen corresponding path program 1 times [2021-10-13 07:53:12,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422655921] [2021-10-13 07:53:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,069 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422655921] [2021-10-13 07:53:12,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422655921] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:53:12,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479202531] [2021-10-13 07:53:12,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:12,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:12,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:12,072 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,182 INFO L93 Difference]: Finished difference Result 250 states and 297 transitions. [2021-10-13 07:53:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:53:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,184 INFO L225 Difference]: With dead ends: 250 [2021-10-13 07:53:12,184 INFO L226 Difference]: Without dead ends: 244 [2021-10-13 07:53:12,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-13 07:53:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 204. [2021-10-13 07:53:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.195) internal successors, (239), 203 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2021-10-13 07:53:12,208 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 27 [2021-10-13 07:53:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,209 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2021-10-13 07:53:12,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2021-10-13 07:53:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:53:12,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 07:53:12,210 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -971245594, now seen corresponding path program 1 times [2021-10-13 07:53:12,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142605566] [2021-10-13 07:53:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142605566] [2021-10-13 07:53:12,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142605566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:53:12,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529686308] [2021-10-13 07:53:12,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:53:12,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:53:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:12,268 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,410 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2021-10-13 07:53:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:53:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:53:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,412 INFO L225 Difference]: With dead ends: 221 [2021-10-13 07:53:12,412 INFO L226 Difference]: Without dead ends: 218 [2021-10-13 07:53:12,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:53:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-10-13 07:53:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2021-10-13 07:53:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 206 states have (on average 1.1893203883495145) internal successors, (245), 209 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2021-10-13 07:53:12,436 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 27 [2021-10-13 07:53:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,436 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2021-10-13 07:53:12,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2021-10-13 07:53:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:53:12,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,438 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 07:53:12,438 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -971257510, now seen corresponding path program 1 times [2021-10-13 07:53:12,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551410633] [2021-10-13 07:53:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551410633] [2021-10-13 07:53:12,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551410633] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:12,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309009560] [2021-10-13 07:53:12,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:12,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:12,499 INFO L87 Difference]: Start difference. First operand 210 states and 245 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,599 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2021-10-13 07:53:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:12,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:53:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,601 INFO L225 Difference]: With dead ends: 218 [2021-10-13 07:53:12,602 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 07:53:12,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 07:53:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2021-10-13 07:53:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.1927083333333333) internal successors, (229), 195 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2021-10-13 07:53:12,624 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 27 [2021-10-13 07:53:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,624 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2021-10-13 07:53:12,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2021-10-13 07:53:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:53:12,625 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,625 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 07:53:12,626 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1445203115, now seen corresponding path program 1 times [2021-10-13 07:53:12,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955198541] [2021-10-13 07:53:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,653 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955198541] [2021-10-13 07:53:12,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955198541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:12,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439774237] [2021-10-13 07:53:12,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:12,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:12,657 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,704 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2021-10-13 07:53:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 07:53:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,706 INFO L225 Difference]: With dead ends: 217 [2021-10-13 07:53:12,706 INFO L226 Difference]: Without dead ends: 196 [2021-10-13 07:53:12,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-10-13 07:53:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2021-10-13 07:53:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.1675392670157068) internal successors, (223), 194 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2021-10-13 07:53:12,729 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 28 [2021-10-13 07:53:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,729 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2021-10-13 07:53:12,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2021-10-13 07:53:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 07:53:12,731 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,731 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 07:53:12,731 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1419537357, now seen corresponding path program 1 times [2021-10-13 07:53:12,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115035323] [2021-10-13 07:53:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115035323] [2021-10-13 07:53:12,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115035323] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:53:12,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050630335] [2021-10-13 07:53:12,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:53:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:53:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:53:12,764 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,797 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2021-10-13 07:53:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:53:12,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 07:53:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,799 INFO L225 Difference]: With dead ends: 199 [2021-10-13 07:53:12,799 INFO L226 Difference]: Without dead ends: 183 [2021-10-13 07:53:12,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-10-13 07:53:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-10-13 07:53:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.1731843575418994) internal successors, (210), 182 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2021-10-13 07:53:12,820 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 30 [2021-10-13 07:53:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:12,820 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2021-10-13 07:53:12,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2021-10-13 07:53:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 07:53:12,821 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:12,821 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:12,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 07:53:12,822 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 826829468, now seen corresponding path program 1 times [2021-10-13 07:53:12,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:12,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329225454] [2021-10-13 07:53:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:12,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:12,859 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:12,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329225454] [2021-10-13 07:53:12,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329225454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:12,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:12,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:53:12,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471600337] [2021-10-13 07:53:12,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:53:12,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:53:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:12,861 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:12,983 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2021-10-13 07:53:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:53:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 07:53:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:12,985 INFO L225 Difference]: With dead ends: 199 [2021-10-13 07:53:12,985 INFO L226 Difference]: Without dead ends: 153 [2021-10-13 07:53:12,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:53:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-10-13 07:53:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2021-10-13 07:53:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 136 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-10-13 07:53:13,003 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 30 [2021-10-13 07:53:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:13,003 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-10-13 07:53:13,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-10-13 07:53:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:53:13,004 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:13,005 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:13,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 07:53:13,005 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 59605634, now seen corresponding path program 1 times [2021-10-13 07:53:13,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:13,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783464216] [2021-10-13 07:53:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:13,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:13,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:13,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783464216] [2021-10-13 07:53:13,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783464216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:13,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:13,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:53:13,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713123060] [2021-10-13 07:53:13,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:53:13,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:53:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:53:13,096 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:13,367 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2021-10-13 07:53:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:53:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-13 07:53:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:13,369 INFO L225 Difference]: With dead ends: 176 [2021-10-13 07:53:13,370 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 07:53:13,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:53:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 07:53:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2021-10-13 07:53:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 136 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-10-13 07:53:13,388 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 33 [2021-10-13 07:53:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:13,388 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-10-13 07:53:13,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-10-13 07:53:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:53:13,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:13,389 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:13,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 07:53:13,390 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1674195647, now seen corresponding path program 1 times [2021-10-13 07:53:13,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:13,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864664093] [2021-10-13 07:53:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:13,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:13,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:13,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864664093] [2021-10-13 07:53:13,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864664093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:13,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:13,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:53:13,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824889121] [2021-10-13 07:53:13,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:53:13,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:53:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:53:13,461 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:13,631 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2021-10-13 07:53:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:53:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-13 07:53:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:13,633 INFO L225 Difference]: With dead ends: 170 [2021-10-13 07:53:13,633 INFO L226 Difference]: Without dead ends: 168 [2021-10-13 07:53:13,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-10-13 07:53:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2021-10-13 07:53:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 1.1735537190082646) internal successors, (142), 122 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2021-10-13 07:53:13,655 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 36 [2021-10-13 07:53:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:13,655 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-10-13 07:53:13,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2021-10-13 07:53:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:53:13,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:13,657 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:13,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 07:53:13,657 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 755581325, now seen corresponding path program 1 times [2021-10-13 07:53:13,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:13,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081259331] [2021-10-13 07:53:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:13,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:13,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:13,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081259331] [2021-10-13 07:53:13,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081259331] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:13,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:13,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:53:13,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050223182] [2021-10-13 07:53:13,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:53:13,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:53:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:13,715 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:13,809 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2021-10-13 07:53:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:53:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-13 07:53:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:13,811 INFO L225 Difference]: With dead ends: 143 [2021-10-13 07:53:13,811 INFO L226 Difference]: Without dead ends: 125 [2021-10-13 07:53:13,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:53:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-13 07:53:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-10-13 07:53:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1626016260162602) internal successors, (143), 124 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2021-10-13 07:53:13,829 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 37 [2021-10-13 07:53:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:13,830 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2021-10-13 07:53:13,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2021-10-13 07:53:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:53:13,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:13,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:13,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 07:53:13,831 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1257169994, now seen corresponding path program 1 times [2021-10-13 07:53:13,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:13,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531610803] [2021-10-13 07:53:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:13,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:13,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:13,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531610803] [2021-10-13 07:53:13,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531610803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:13,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:13,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:53:13,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322594815] [2021-10-13 07:53:13,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:53:13,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:53:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:53:13,906 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:14,035 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-10-13 07:53:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:53:14,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-13 07:53:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:14,037 INFO L225 Difference]: With dead ends: 141 [2021-10-13 07:53:14,037 INFO L226 Difference]: Without dead ends: 125 [2021-10-13 07:53:14,040 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:53:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-13 07:53:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-10-13 07:53:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1544715447154472) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-10-13 07:53:14,059 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 37 [2021-10-13 07:53:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:14,060 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-10-13 07:53:14,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-10-13 07:53:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 07:53:14,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:14,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:14,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 07:53:14,061 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1095271655, now seen corresponding path program 1 times [2021-10-13 07:53:14,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:14,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686152680] [2021-10-13 07:53:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:14,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:53:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:53:14,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:53:14,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686152680] [2021-10-13 07:53:14,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686152680] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:53:14,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:53:14,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:53:14,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607152980] [2021-10-13 07:53:14,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:53:14,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:53:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:53:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:14,090 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:53:14,126 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2021-10-13 07:53:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:53:14,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-10-13 07:53:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:53:14,128 INFO L225 Difference]: With dead ends: 225 [2021-10-13 07:53:14,128 INFO L226 Difference]: Without dead ends: 155 [2021-10-13 07:53:14,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:53:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-13 07:53:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2021-10-13 07:53:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.1300813008130082) internal successors, (139), 124 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2021-10-13 07:53:14,147 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 38 [2021-10-13 07:53:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:53:14,147 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2021-10-13 07:53:14,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:53:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2021-10-13 07:53:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 07:53:14,148 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:53:14,148 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:53:14,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 07:53:14,150 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 07:53:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:53:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1099571465, now seen corresponding path program 1 times [2021-10-13 07:53:14,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:53:14,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972556653] [2021-10-13 07:53:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:53:14,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:53:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:53:14,177 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:53:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:53:14,252 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:53:14,252 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:53:14,254 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,263 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,264 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,265 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,271 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:53:14,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 07:53:14,278 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:53:14,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:53:14 BoogieIcfgContainer [2021-10-13 07:53:14,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:53:14,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:53:14,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:53:14,425 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:53:14,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:53:06" (3/4) ... [2021-10-13 07:53:14,427 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:53:14,565 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:53:14,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:53:14,567 INFO L168 Benchmark]: Toolchain (without parser) took 10888.09 ms. Allocated memory was 96.5 MB in the beginning and 272.6 MB in the end (delta: 176.2 MB). Free memory was 65.5 MB in the beginning and 226.8 MB in the end (delta: -161.3 MB). Peak memory consumption was 150.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,567 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 96.5 MB. Free memory is still 51.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:53:14,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.22 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 62.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.62 ms. Allocated memory is still 96.5 MB. Free memory was 62.6 MB in the beginning and 55.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,568 INFO L168 Benchmark]: Boogie Preprocessor took 80.44 ms. Allocated memory is still 96.5 MB. Free memory was 55.0 MB in the beginning and 50.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,568 INFO L168 Benchmark]: RCFGBuilder took 2435.23 ms. Allocated memory was 96.5 MB in the beginning and 169.9 MB in the end (delta: 73.4 MB). Free memory was 50.1 MB in the beginning and 122.8 MB in the end (delta: -72.7 MB). Peak memory consumption was 36.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,569 INFO L168 Benchmark]: TraceAbstraction took 7444.86 ms. Allocated memory was 169.9 MB in the beginning and 272.6 MB in the end (delta: 102.8 MB). Free memory was 121.7 MB in the beginning and 96.3 MB in the end (delta: 25.5 MB). Peak memory consumption was 128.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,569 INFO L168 Benchmark]: Witness Printer took 140.98 ms. Allocated memory is still 272.6 MB. Free memory was 96.3 MB in the beginning and 226.8 MB in the end (delta: -130.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:53:14,571 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.25 ms. Allocated memory is still 96.5 MB. Free memory is still 51.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 639.22 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 62.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 137.62 ms. Allocated memory is still 96.5 MB. Free memory was 62.6 MB in the beginning and 55.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.44 ms. Allocated memory is still 96.5 MB. Free memory was 55.0 MB in the beginning and 50.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2435.23 ms. Allocated memory was 96.5 MB in the beginning and 169.9 MB in the end (delta: 73.4 MB). Free memory was 50.1 MB in the beginning and 122.8 MB in the end (delta: -72.7 MB). Peak memory consumption was 36.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7444.86 ms. Allocated memory was 169.9 MB in the beginning and 272.6 MB in the end (delta: 102.8 MB). Free memory was 121.7 MB in the beginning and 96.3 MB in the end (delta: 25.5 MB). Peak memory consumption was 128.2 MB. Max. memory is 16.1 GB. * Witness Printer took 140.98 ms. Allocated memory is still 272.6 MB. Free memory was 96.3 MB in the beginning and 226.8 MB in the end (delta: -130.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] int FloppyThread ; [L37] int KernelMode ; [L38] int Suspended ; [L39] int Executive ; [L40] int DiskController ; [L41] int FloppyDiskPeripheral ; [L42] int FlConfigCallBack ; [L43] int MaximumInterfaceType ; [L44] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L45] int myStatus ; [L46] int s ; [L47] int UNLOADED ; [L48] int NP ; [L49] int DC ; [L50] int SKIP1 ; [L51] int SKIP2 ; [L52] int MPR1 ; [L53] int MPR3 ; [L54] int IPC ; [L55] int pended ; [L56] int compRegistered ; [L57] int lowerDriverReturn ; [L58] int setEventCalled ; [L59] int customIrp ; [L91] int PagingReferenceCount = 0; [L92] int PagingMutex = 0; [L671] int status ; [L672] int irp = __VERIFIER_nondet_int() ; [L673] int pirp ; [L674] int pirp__IoStatus__Status ; [L675] int irp_choice = __VERIFIER_nondet_int() ; [L676] int devobj = __VERIFIER_nondet_int() ; [L677] int __cil_tmp8 ; [L679] FloppyThread = 0 [L680] KernelMode = 0 [L681] Suspended = 0 [L682] Executive = 0 [L683] DiskController = 0 [L684] FloppyDiskPeripheral = 0 [L685] FlConfigCallBack = 0 [L686] MaximumInterfaceType = 0 [L687] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L688] myStatus = 0 [L689] s = 0 [L690] UNLOADED = 0 [L691] NP = 0 [L692] DC = 0 [L693] SKIP1 = 0 [L694] SKIP2 = 0 [L695] MPR1 = 0 [L696] MPR3 = 0 [L697] IPC = 0 [L698] pended = 0 [L699] compRegistered = 0 [L700] lowerDriverReturn = 0 [L701] setEventCalled = 0 [L702] customIrp = 0 [L706] status = 0 [L707] pirp = irp [L74] UNLOADED = 0 [L75] NP = 1 [L76] DC = 2 [L77] SKIP1 = 3 [L78] SKIP2 = 4 [L79] MPR1 = 5 [L80] MPR3 = 6 [L81] IPC = 7 [L82] s = UNLOADED [L83] pended = 0 [L84] compRegistered = 0 [L85] lowerDriverReturn = 0 [L86] setEventCalled = 0 [L87] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L710] COND TRUE status >= 0 [L711] s = NP [L712] customIrp = 0 [L713] setEventCalled = customIrp [L714] lowerDriverReturn = setEventCalled [L715] compRegistered = lowerDriverReturn [L716] pended = compRegistered [L717] pirp__IoStatus__Status = 0 [L718] myStatus = 0 [L719] COND TRUE irp_choice == 0 [L720] pirp__IoStatus__Status = -1073741637 [L721] myStatus = -1073741637 [L661] s = NP [L662] pended = 0 [L663] compRegistered = 0 [L664] lowerDriverReturn = 0 [L665] setEventCalled = 0 [L666] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L727] COND FALSE !(status < 0) [L731] int tmp_ndt_1; [L732] tmp_ndt_1 = __VERIFIER_nondet_int() [L733] COND TRUE tmp_ndt_1 == 3 [L164] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L165] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L166] int Irp__IoStatus__Information ; [L167] int Irp__IoStatus__Status ; [L168] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L170] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L171] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L172] int disketteExtension__HoldNewRequests ; [L173] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L175] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L177] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L178] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L179] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L180] int irpSp ; [L181] int disketteExtension ; [L182] int ntStatus ; [L183] int doneEvent = __VERIFIER_nondet_int() ; [L184] int irpSp___0 ; [L185] int nextIrpSp ; [L186] int nextIrpSp__Control ; [L187] int irpSp___1 ; [L188] int irpSp__Context ; [L189] int irpSp__Control ; [L190] long __cil_tmp29 ; [L191] long __cil_tmp30 ; [L194] ntStatus = 0 [L195] PagingReferenceCount ++ [L196] COND TRUE PagingReferenceCount == 1 [L199] disketteExtension = DeviceObject__DeviceExtension [L200] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L201] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L213] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L242] COND FALSE !(! disketteExtension__IsStarted) [L258] disketteExtension__HoldNewRequests = 1 [L101] int status ; [L102] int threadHandle = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L105] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L106] int Irp__IoStatus__Status ; [L107] int Irp__IoStatus__Information ; [L108] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L109] int ObjAttributes = __VERIFIER_nondet_int() ; [L110] int __cil_tmp12 ; [L111] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L114] COND FALSE !(DisketteExtension__PoweringDown == 1) [L120] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L121] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L153] COND TRUE pended == 0 [L154] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L160] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L259] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L262] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L263] COND TRUE __cil_tmp29 == 259L [L1036] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1045] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1049] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1056] int tmp_ndt_8; [L1057] tmp_ndt_8 = __VERIFIER_nondet_int() [L1058] COND TRUE tmp_ndt_8 == 0 [L1064] return (0); [L268] COND TRUE disketteExtension__FloppyThread != 0 [L271] disketteExtension__FloppyThread = 0 [L272] Irp__IoStatus__Status = 0 [L273] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L274] COND TRUE s == NP [L275] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L282] Irp__CurrentLocation ++ [L283] Irp__Tail__Overlay__CurrentStackLocation ++ [L938] int returnVal2 ; [L939] int compRetStatus1 ; [L940] int lcontext = __VERIFIER_nondet_int() ; [L941] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L944] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L957] int tmp_ndt_12; [L958] tmp_ndt_12 = __VERIFIER_nondet_int() [L959] COND FALSE !(tmp_ndt_12 == 0) [L962] int tmp_ndt_7; [L963] tmp_ndt_7 = __VERIFIER_nondet_int() [L964] COND TRUE tmp_ndt_7 == 1 [L973] returnVal2 = -1073741823 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L983] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L996] COND TRUE s == SKIP1 [L997] s = SKIP2 [L998] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1006] return (returnVal2); [L284] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L430] PagingReferenceCount -- [L431] COND TRUE PagingReferenceCount == 0 [L434] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L740] status = FloppyPnp(devobj, pirp) [L750] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L751] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L758] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L759] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L768] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L782] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L783] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L65] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 258 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 7232.2ms, OverallIterations: 35, TraceHistogramMax: 1, EmptinessCheckTime: 50.7ms, AutomataDifference: 3929.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7035 SDtfs, 4766 SDslu, 6893 SDs, 0 SdLazy, 2787 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1918.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 524.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=6, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 743.1ms AutomataMinimizationTime, 34 MinimizatonAttempts, 612 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 131.8ms SsaConstructionTime, 525.5ms SatisfiabilityAnalysisTime, 1314.5ms InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 2099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-13 07:53:14,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ced9168f-7992-4f36-8c06-8dfda3ed2fb8/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...