./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/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_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG --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 ea94c2a7f5c98d387db22a0b269794366125ef96ca4390d29fd777c1f058153c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-b2eff8b [2021-10-29 05:10:25,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:10:25,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:10:25,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:10:25,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:10:25,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:10:25,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:10:25,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:10:25,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:10:25,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:10:25,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:10:25,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:10:25,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:10:25,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:10:25,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:10:25,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:10:25,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:10:25,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:10:25,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:10:25,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:10:25,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:10:25,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:10:25,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:10:25,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:10:25,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:10:25,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:10:25,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:10:25,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:10:25,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:10:25,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:10:25,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:10:25,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:10:25,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:10:25,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:10:25,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:10:25,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:10:25,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:10:25,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:10:25,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:10:25,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:10:25,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:10:25,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:10:25,339 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:10:25,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:10:25,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:10:25,342 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:10:25,342 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:10:25,343 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:10:25,343 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:10:25,343 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:10:25,343 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:10:25,343 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:10:25,344 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:10:25,345 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:10:25,345 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:10:25,345 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:10:25,345 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:10:25,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:10:25,346 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:10:25,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:10:25,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:10:25,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:10:25,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:10:25,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:10:25,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:10:25,348 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:10:25,348 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:10:25,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:10:25,348 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:10:25,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:10:25,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:10:25,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:10:25,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:10:25,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:10:25,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:10:25,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:10:25,350 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:10:25,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:10:25,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:10:25,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:10:25,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:10:25,351 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_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/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_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG 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 -> ea94c2a7f5c98d387db22a0b269794366125ef96ca4390d29fd777c1f058153c [2021-10-29 05:10:25,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:10:25,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:10:25,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:10:25,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:10:25,683 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:10:25,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-29 05:10:25,769 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/data/16c36117e/4b38532bebb547ff881dc13754a5d54d/FLAG5adb5f2e0 [2021-10-29 05:10:26,270 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:10:26,270 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-29 05:10:26,284 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/data/16c36117e/4b38532bebb547ff881dc13754a5d54d/FLAG5adb5f2e0 [2021-10-29 05:10:26,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/data/16c36117e/4b38532bebb547ff881dc13754a5d54d [2021-10-29 05:10:26,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:10:26,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:10:26,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:10:26,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:10:26,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:10:26,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:10:26" (1/1) ... [2021-10-29 05:10:26,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e725a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:26, skipping insertion in model container [2021-10-29 05:10:26,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:10:26" (1/1) ... [2021-10-29 05:10:26,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:10:26,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:10:26,917 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_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-29 05:10:27,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:10:27,124 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:10:27,140 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_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-29 05:10:27,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:10:27,227 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:10:27,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27 WrapperNode [2021-10-29 05:10:27,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:10:27,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:10:27,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:10:27,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:10:27,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:10:27,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:10:27,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:10:27,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:10:27,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:10:27,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:10:27,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:10:27,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:10:27,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (1/1) ... [2021-10-29 05:10:27,461 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:10:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:10:27,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:10:27,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:10:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:10:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:10:27,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:10:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:10:27,784 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,791 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,800 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,805 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,808 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,813 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,818 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,823 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,841 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,843 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,850 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,872 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,873 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,876 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,880 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,886 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,900 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,902 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,905 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,917 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,918 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,919 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:27,921 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:10:28,821 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-29 05:10:28,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-29 05:10:28,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-29 05:10:28,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-29 05:10:28,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-29 05:10:28,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-29 05:10:28,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-29 05:10:28,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-29 05:10:28,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-29 05:10:28,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-29 05:10:29,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:10:29,809 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-10-29 05:10:29,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:10:29 BoogieIcfgContainer [2021-10-29 05:10:29,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:10:29,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:10:29,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:10:29,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:10:29,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:10:26" (1/3) ... [2021-10-29 05:10:29,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15514775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:10:29, skipping insertion in model container [2021-10-29 05:10:29,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:10:27" (2/3) ... [2021-10-29 05:10:29,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15514775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:10:29, skipping insertion in model container [2021-10-29 05:10:29,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:10:29" (3/3) ... [2021-10-29 05:10:29,827 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2021-10-29 05:10:29,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:10:29,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-10-29 05:10:29,896 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:10:29,902 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:10:29,903 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-10-29 05:10:29,924 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-29 05:10:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 05:10:29,929 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:29,930 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:29,930 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-29 05:10:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -510467847, now seen corresponding path program 1 times [2021-10-29 05:10:29,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:29,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139219204] [2021-10-29 05:10:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:29,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:30,147 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-29 05:10:30,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:30,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139219204] [2021-10-29 05:10:30,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139219204] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:30,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:30,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:30,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889941150] [2021-10-29 05:10:30,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:30,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,173 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-29 05:10:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:30,459 INFO L93 Difference]: Finished difference Result 486 states and 724 transitions. [2021-10-29 05:10:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:30,462 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-29 05:10:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:30,483 INFO L225 Difference]: With dead ends: 486 [2021-10-29 05:10:30,484 INFO L226 Difference]: Without dead ends: 259 [2021-10-29 05:10:30,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-29 05:10:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2021-10-29 05:10:30,571 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-29 05:10:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 343 transitions. [2021-10-29 05:10:30,574 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 343 transitions. Word has length 7 [2021-10-29 05:10:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:30,575 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 343 transitions. [2021-10-29 05:10:30,576 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-29 05:10:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 343 transitions. [2021-10-29 05:10:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:10:30,577 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:30,577 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:30,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:10:30,578 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-29 05:10:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -873900632, now seen corresponding path program 1 times [2021-10-29 05:10:30,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:30,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086622680] [2021-10-29 05:10:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:30,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:30,698 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-29 05:10:30,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:30,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086622680] [2021-10-29 05:10:30,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086622680] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:30,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:30,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:30,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248569741] [2021-10-29 05:10:30,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:30,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,702 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-29 05:10:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:30,751 INFO L93 Difference]: Finished difference Result 481 states and 629 transitions. [2021-10-29 05:10:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:30,752 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-29 05:10:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:30,754 INFO L225 Difference]: With dead ends: 481 [2021-10-29 05:10:30,754 INFO L226 Difference]: Without dead ends: 336 [2021-10-29 05:10:30,756 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-29 05:10:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 247. [2021-10-29 05:10:30,769 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-29 05:10:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2021-10-29 05:10:30,770 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 9 [2021-10-29 05:10:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:30,770 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2021-10-29 05:10:30,771 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-29 05:10:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2021-10-29 05:10:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:10:30,772 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:30,772 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:30,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:10:30,772 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-29 05:10:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 765253587, now seen corresponding path program 1 times [2021-10-29 05:10:30,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:30,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777536472] [2021-10-29 05:10:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:30,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:30,813 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-29 05:10:30,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:30,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777536472] [2021-10-29 05:10:30,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777536472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:30,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:30,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:10:30,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830570651] [2021-10-29 05:10:30,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:30,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,817 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-29 05:10:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:30,834 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-10-29 05:10:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:30,835 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-29 05:10:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:30,837 INFO L225 Difference]: With dead ends: 269 [2021-10-29 05:10:30,837 INFO L226 Difference]: Without dead ends: 247 [2021-10-29 05:10:30,838 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-29 05:10:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-10-29 05:10:30,848 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-29 05:10:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 325 transitions. [2021-10-29 05:10:30,850 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 325 transitions. Word has length 10 [2021-10-29 05:10:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:30,850 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 325 transitions. [2021-10-29 05:10:30,850 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-29 05:10:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 325 transitions. [2021-10-29 05:10:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 05:10:30,852 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:30,852 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:30,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:10:30,853 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-29 05:10:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1366602656, now seen corresponding path program 1 times [2021-10-29 05:10:30,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:30,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124624453] [2021-10-29 05:10:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:30,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:30,917 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-29 05:10:30,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:30,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124624453] [2021-10-29 05:10:30,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124624453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:30,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:30,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:30,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731439330] [2021-10-29 05:10:30,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:30,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,920 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-29 05:10:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:30,949 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2021-10-29 05:10:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:30,949 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-29 05:10:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:30,952 INFO L225 Difference]: With dead ends: 307 [2021-10-29 05:10:30,952 INFO L226 Difference]: Without dead ends: 284 [2021-10-29 05:10:30,952 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-29 05:10:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 271. [2021-10-29 05:10:30,965 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-29 05:10:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2021-10-29 05:10:30,967 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 13 [2021-10-29 05:10:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:30,967 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2021-10-29 05:10:30,967 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-29 05:10:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2021-10-29 05:10:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 05:10:30,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:30,970 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:30,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:10:30,970 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-29 05:10:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash -897998562, now seen corresponding path program 1 times [2021-10-29 05:10:30,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:30,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519096568] [2021-10-29 05:10:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:30,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:31,030 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-29 05:10:31,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:31,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519096568] [2021-10-29 05:10:31,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519096568] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:31,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:31,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:10:31,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859638514] [2021-10-29 05:10:31,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:31,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:31,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:31,033 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-29 05:10:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:31,067 INFO L93 Difference]: Finished difference Result 337 states and 429 transitions. [2021-10-29 05:10:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:10:31,068 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-29 05:10:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:31,070 INFO L225 Difference]: With dead ends: 337 [2021-10-29 05:10:31,070 INFO L226 Difference]: Without dead ends: 301 [2021-10-29 05:10:31,071 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-29 05:10:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2021-10-29 05:10:31,083 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-29 05:10:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2021-10-29 05:10:31,085 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 16 [2021-10-29 05:10:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:31,085 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2021-10-29 05:10:31,086 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-29 05:10:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2021-10-29 05:10:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 05:10:31,087 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:31,088 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:31,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:10:31,088 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-29 05:10:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1711216500, now seen corresponding path program 1 times [2021-10-29 05:10:31,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:31,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067776856] [2021-10-29 05:10:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:31,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:31,124 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-29 05:10:31,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:31,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067776856] [2021-10-29 05:10:31,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067776856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:31,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:31,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:31,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902647005] [2021-10-29 05:10:31,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:31,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,127 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-29 05:10:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:31,253 INFO L93 Difference]: Finished difference Result 289 states and 377 transitions. [2021-10-29 05:10:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:31,254 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-29 05:10:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:31,256 INFO L225 Difference]: With dead ends: 289 [2021-10-29 05:10:31,256 INFO L226 Difference]: Without dead ends: 284 [2021-10-29 05:10:31,257 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-29 05:10:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2021-10-29 05:10:31,270 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-29 05:10:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2021-10-29 05:10:31,272 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 16 [2021-10-29 05:10:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:31,272 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2021-10-29 05:10:31,272 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-29 05:10:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2021-10-29 05:10:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:10:31,274 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:31,274 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:31,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:10:31,275 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-29 05:10:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 274723131, now seen corresponding path program 1 times [2021-10-29 05:10:31,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:31,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777637036] [2021-10-29 05:10:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:31,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:31,319 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-29 05:10:31,320 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:31,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777637036] [2021-10-29 05:10:31,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777637036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:31,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:31,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:31,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632979523] [2021-10-29 05:10:31,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:31,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,323 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-29 05:10:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:31,469 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2021-10-29 05:10:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:31,470 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-29 05:10:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:31,478 INFO L225 Difference]: With dead ends: 381 [2021-10-29 05:10:31,478 INFO L226 Difference]: Without dead ends: 278 [2021-10-29 05:10:31,480 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-29 05:10:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-10-29 05:10:31,495 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-29 05:10:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 365 transitions. [2021-10-29 05:10:31,497 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 365 transitions. Word has length 17 [2021-10-29 05:10:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:31,500 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 365 transitions. [2021-10-29 05:10:31,500 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-29 05:10:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 365 transitions. [2021-10-29 05:10:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:10:31,502 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:31,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:31,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:10:31,503 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-29 05:10:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 846281230, now seen corresponding path program 1 times [2021-10-29 05:10:31,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:31,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086903601] [2021-10-29 05:10:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:31,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:31,577 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-29 05:10:31,577 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:31,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086903601] [2021-10-29 05:10:31,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086903601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:31,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:31,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:31,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706480428] [2021-10-29 05:10:31,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:31,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,580 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-29 05:10:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:31,702 INFO L93 Difference]: Finished difference Result 278 states and 365 transitions. [2021-10-29 05:10:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:31,703 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-29 05:10:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:31,705 INFO L225 Difference]: With dead ends: 278 [2021-10-29 05:10:31,706 INFO L226 Difference]: Without dead ends: 266 [2021-10-29 05:10:31,706 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-29 05:10:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-29 05:10:31,722 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-29 05:10:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2021-10-29 05:10:31,724 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 17 [2021-10-29 05:10:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:31,724 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2021-10-29 05:10:31,724 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-29 05:10:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2021-10-29 05:10:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:10:31,726 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:31,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:31,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:10:31,726 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-29 05:10:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1525683153, now seen corresponding path program 1 times [2021-10-29 05:10:31,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:31,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63437568] [2021-10-29 05:10:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:31,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:31,801 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-29 05:10:31,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:31,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63437568] [2021-10-29 05:10:31,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63437568] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:31,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:31,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:31,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424067241] [2021-10-29 05:10:31,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:31,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:31,810 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-29 05:10:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:31,953 INFO L93 Difference]: Finished difference Result 278 states and 363 transitions. [2021-10-29 05:10:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:31,953 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-29 05:10:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:31,956 INFO L225 Difference]: With dead ends: 278 [2021-10-29 05:10:31,956 INFO L226 Difference]: Without dead ends: 269 [2021-10-29 05:10:31,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-10-29 05:10:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2021-10-29 05:10:31,982 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-29 05:10:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2021-10-29 05:10:31,984 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 17 [2021-10-29 05:10:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:31,984 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2021-10-29 05:10:31,984 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-29 05:10:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2021-10-29 05:10:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 05:10:31,986 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:31,986 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:31,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:10:31,987 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-29 05:10:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1981549689, now seen corresponding path program 1 times [2021-10-29 05:10:31,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:31,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976555776] [2021-10-29 05:10:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:31,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,055 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-29 05:10:32,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976555776] [2021-10-29 05:10:32,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976555776] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:32,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579345617] [2021-10-29 05:10:32,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:32,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,060 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-29 05:10:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:32,101 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2021-10-29 05:10:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:32,102 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-29 05:10:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:32,104 INFO L225 Difference]: With dead ends: 359 [2021-10-29 05:10:32,104 INFO L226 Difference]: Without dead ends: 264 [2021-10-29 05:10:32,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-29 05:10:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2021-10-29 05:10:32,135 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-29 05:10:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 324 transitions. [2021-10-29 05:10:32,137 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 324 transitions. Word has length 18 [2021-10-29 05:10:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:32,138 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 324 transitions. [2021-10-29 05:10:32,138 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-29 05:10:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 324 transitions. [2021-10-29 05:10:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 05:10:32,140 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:32,140 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:32,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:10:32,141 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-29 05:10:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -481424925, now seen corresponding path program 1 times [2021-10-29 05:10:32,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:32,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260658699] [2021-10-29 05:10:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:32,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,205 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-29 05:10:32,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260658699] [2021-10-29 05:10:32,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260658699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:32,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346866814] [2021-10-29 05:10:32,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:32,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:32,210 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-29 05:10:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:32,375 INFO L93 Difference]: Finished difference Result 262 states and 334 transitions. [2021-10-29 05:10:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:32,376 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-29 05:10:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:32,379 INFO L225 Difference]: With dead ends: 262 [2021-10-29 05:10:32,379 INFO L226 Difference]: Without dead ends: 253 [2021-10-29 05:10:32,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-29 05:10:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2021-10-29 05:10:32,397 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-29 05:10:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2021-10-29 05:10:32,399 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 18 [2021-10-29 05:10:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:32,399 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2021-10-29 05:10:32,400 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-29 05:10:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2021-10-29 05:10:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:10:32,401 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:32,401 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:32,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:10:32,402 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-29 05:10:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1492059418, now seen corresponding path program 1 times [2021-10-29 05:10:32,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:32,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583845998] [2021-10-29 05:10:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:32,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,445 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-29 05:10:32,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583845998] [2021-10-29 05:10:32,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583845998] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:32,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778832623] [2021-10-29 05:10:32,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:32,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,453 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-29 05:10:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:32,583 INFO L93 Difference]: Finished difference Result 324 states and 411 transitions. [2021-10-29 05:10:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:32,583 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-29 05:10:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:32,586 INFO L225 Difference]: With dead ends: 324 [2021-10-29 05:10:32,586 INFO L226 Difference]: Without dead ends: 316 [2021-10-29 05:10:32,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-29 05:10:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2021-10-29 05:10:32,604 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-29 05:10:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2021-10-29 05:10:32,606 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 19 [2021-10-29 05:10:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:32,607 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2021-10-29 05:10:32,608 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-29 05:10:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2021-10-29 05:10:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:10:32,609 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:32,609 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:32,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:10:32,610 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-29 05:10:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1891738440, now seen corresponding path program 1 times [2021-10-29 05:10:32,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:32,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231418622] [2021-10-29 05:10:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:32,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,648 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-29 05:10:32,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231418622] [2021-10-29 05:10:32,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231418622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:10:32,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697377004] [2021-10-29 05:10:32,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:32,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:32,651 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-29 05:10:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:32,691 INFO L93 Difference]: Finished difference Result 271 states and 346 transitions. [2021-10-29 05:10:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:32,691 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-29 05:10:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:32,693 INFO L225 Difference]: With dead ends: 271 [2021-10-29 05:10:32,693 INFO L226 Difference]: Without dead ends: 256 [2021-10-29 05:10:32,694 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-29 05:10:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-29 05:10:32,712 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-29 05:10:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2021-10-29 05:10:32,713 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 19 [2021-10-29 05:10:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:32,713 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2021-10-29 05:10:32,714 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-29 05:10:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2021-10-29 05:10:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:10:32,715 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:32,715 INFO L513 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-29 05:10:32,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:10:32,715 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-29 05:10:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash 983139277, now seen corresponding path program 1 times [2021-10-29 05:10:32,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:32,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365095200] [2021-10-29 05:10:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:32,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,753 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-29 05:10:32,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365095200] [2021-10-29 05:10:32,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365095200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:32,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935087480] [2021-10-29 05:10:32,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:32,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,756 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-29 05:10:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:32,792 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2021-10-29 05:10:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:32,792 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-29 05:10:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:32,794 INFO L225 Difference]: With dead ends: 373 [2021-10-29 05:10:32,794 INFO L226 Difference]: Without dead ends: 279 [2021-10-29 05:10:32,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-29 05:10:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2021-10-29 05:10:32,815 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-29 05:10:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2021-10-29 05:10:32,816 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 20 [2021-10-29 05:10:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:32,817 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2021-10-29 05:10:32,817 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-29 05:10:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2021-10-29 05:10:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:10:32,819 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:32,819 INFO L513 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-29 05:10:32,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:10:32,820 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-29 05:10:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1221054761, now seen corresponding path program 1 times [2021-10-29 05:10:32,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:32,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491844945] [2021-10-29 05:10:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:32,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:32,886 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-29 05:10:32,887 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:32,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491844945] [2021-10-29 05:10:32,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491844945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:32,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:32,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:32,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703319665] [2021-10-29 05:10:32,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:32,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:32,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:32,890 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-29 05:10:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:33,041 INFO L93 Difference]: Finished difference Result 279 states and 354 transitions. [2021-10-29 05:10:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:33,042 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-29 05:10:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:33,045 INFO L225 Difference]: With dead ends: 279 [2021-10-29 05:10:33,045 INFO L226 Difference]: Without dead ends: 239 [2021-10-29 05:10:33,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-10-29 05:10:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-10-29 05:10:33,067 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-29 05:10:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2021-10-29 05:10:33,069 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 20 [2021-10-29 05:10:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:33,069 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2021-10-29 05:10:33,069 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-29 05:10:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2021-10-29 05:10:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:10:33,073 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:33,073 INFO L513 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-29 05:10:33,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:10:33,073 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-29 05:10:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2081358437, now seen corresponding path program 1 times [2021-10-29 05:10:33,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:33,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708040805] [2021-10-29 05:10:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:33,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:33,237 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-29 05:10:33,238 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:33,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708040805] [2021-10-29 05:10:33,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708040805] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:33,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:33,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:33,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307924442] [2021-10-29 05:10:33,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:33,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:33,243 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-29 05:10:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:33,311 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2021-10-29 05:10:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:33,312 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-29 05:10:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:33,314 INFO L225 Difference]: With dead ends: 339 [2021-10-29 05:10:33,314 INFO L226 Difference]: Without dead ends: 241 [2021-10-29 05:10:33,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-29 05:10:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2021-10-29 05:10:33,337 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-29 05:10:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2021-10-29 05:10:33,338 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 21 [2021-10-29 05:10:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:33,339 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2021-10-29 05:10:33,339 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-29 05:10:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2021-10-29 05:10:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:10:33,340 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:33,340 INFO L513 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-29 05:10:33,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:10:33,340 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-29 05:10:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2014999082, now seen corresponding path program 1 times [2021-10-29 05:10:33,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:33,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824462654] [2021-10-29 05:10:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:33,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:33,388 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-29 05:10:33,389 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:33,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824462654] [2021-10-29 05:10:33,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824462654] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:33,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:33,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:33,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545204249] [2021-10-29 05:10:33,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:33,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:33,392 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-29 05:10:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:33,541 INFO L93 Difference]: Finished difference Result 342 states and 427 transitions. [2021-10-29 05:10:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:33,542 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-29 05:10:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:33,544 INFO L225 Difference]: With dead ends: 342 [2021-10-29 05:10:33,544 INFO L226 Difference]: Without dead ends: 256 [2021-10-29 05:10:33,545 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-29 05:10:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-10-29 05:10:33,575 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-29 05:10:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-10-29 05:10:33,576 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 22 [2021-10-29 05:10:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:33,577 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-10-29 05:10:33,577 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-29 05:10:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-10-29 05:10:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:10:33,578 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:33,578 INFO L513 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-29 05:10:33,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:10:33,579 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-29 05:10:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1370270137, now seen corresponding path program 1 times [2021-10-29 05:10:33,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:33,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444393976] [2021-10-29 05:10:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:33,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:33,659 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-29 05:10:33,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:33,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444393976] [2021-10-29 05:10:33,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444393976] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:33,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:33,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:10:33,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908486236] [2021-10-29 05:10:33,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:10:33,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:10:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:33,663 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-29 05:10:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:33,939 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2021-10-29 05:10:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:10:33,939 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-29 05:10:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:33,941 INFO L225 Difference]: With dead ends: 303 [2021-10-29 05:10:33,942 INFO L226 Difference]: Without dead ends: 299 [2021-10-29 05:10:33,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-29 05:10:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 227. [2021-10-29 05:10:33,966 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-29 05:10:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 284 transitions. [2021-10-29 05:10:33,967 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 284 transitions. Word has length 23 [2021-10-29 05:10:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:33,967 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 284 transitions. [2021-10-29 05:10:33,968 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-29 05:10:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2021-10-29 05:10:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:10:33,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:33,969 INFO L513 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-29 05:10:33,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 05:10:33,969 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-29 05:10:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1831218950, now seen corresponding path program 1 times [2021-10-29 05:10:33,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:33,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95786580] [2021-10-29 05:10:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:33,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:34,010 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-29 05:10:34,011 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:34,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95786580] [2021-10-29 05:10:34,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95786580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:34,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:34,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:34,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866368769] [2021-10-29 05:10:34,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:34,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:34,013 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-29 05:10:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:34,186 INFO L93 Difference]: Finished difference Result 299 states and 367 transitions. [2021-10-29 05:10:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:34,187 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-29 05:10:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:34,190 INFO L225 Difference]: With dead ends: 299 [2021-10-29 05:10:34,190 INFO L226 Difference]: Without dead ends: 256 [2021-10-29 05:10:34,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-29 05:10:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 227. [2021-10-29 05:10:34,225 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-29 05:10:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2021-10-29 05:10:34,242 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 24 [2021-10-29 05:10:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:34,242 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2021-10-29 05:10:34,242 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-29 05:10:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2021-10-29 05:10:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:10:34,244 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:34,244 INFO L513 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-29 05:10:34,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:10:34,244 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-29 05:10:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -867731228, now seen corresponding path program 1 times [2021-10-29 05:10:34,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:34,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11257533] [2021-10-29 05:10:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:34,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:34,281 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-29 05:10:34,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:34,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11257533] [2021-10-29 05:10:34,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11257533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:34,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:34,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:34,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037027435] [2021-10-29 05:10:34,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:34,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:34,284 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-29 05:10:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:34,398 INFO L93 Difference]: Finished difference Result 270 states and 328 transitions. [2021-10-29 05:10:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:34,399 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-29 05:10:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:34,400 INFO L225 Difference]: With dead ends: 270 [2021-10-29 05:10:34,400 INFO L226 Difference]: Without dead ends: 227 [2021-10-29 05:10:34,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-29 05:10:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-10-29 05:10:34,426 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-29 05:10:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-10-29 05:10:34,427 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-10-29 05:10:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:34,427 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-10-29 05:10:34,428 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-29 05:10:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-10-29 05:10:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:10:34,429 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:34,429 INFO L513 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-29 05:10:34,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:10:34,430 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-29 05:10:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1729621359, now seen corresponding path program 1 times [2021-10-29 05:10:34,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:34,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927506212] [2021-10-29 05:10:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:34,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:34,493 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-29 05:10:34,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:34,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927506212] [2021-10-29 05:10:34,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927506212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:34,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:34,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:10:34,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621012231] [2021-10-29 05:10:34,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:10:34,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:10:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:34,495 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-29 05:10:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:34,692 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-10-29 05:10:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:10:34,692 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-29 05:10:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:34,694 INFO L225 Difference]: With dead ends: 247 [2021-10-29 05:10:34,695 INFO L226 Difference]: Without dead ends: 245 [2021-10-29 05:10:34,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-29 05:10:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-10-29 05:10:34,721 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-29 05:10:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-10-29 05:10:34,722 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 25 [2021-10-29 05:10:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:34,724 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-10-29 05:10:34,724 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-29 05:10:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-10-29 05:10:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:10:34,725 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:34,726 INFO L513 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-29 05:10:34,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:10:34,726 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-29 05:10:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash -890782658, now seen corresponding path program 1 times [2021-10-29 05:10:34,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:34,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902066731] [2021-10-29 05:10:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:34,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:34,785 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-29 05:10:34,786 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:34,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902066731] [2021-10-29 05:10:34,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902066731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:34,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:34,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:10:34,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827813023] [2021-10-29 05:10:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:10:34,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:10:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:34,789 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-29 05:10:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:34,862 INFO L93 Difference]: Finished difference Result 245 states and 289 transitions. [2021-10-29 05:10:34,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:10:34,863 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-29 05:10:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:34,864 INFO L225 Difference]: With dead ends: 245 [2021-10-29 05:10:34,864 INFO L226 Difference]: Without dead ends: 228 [2021-10-29 05:10:34,866 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:10:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-29 05:10:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-10-29 05:10:34,891 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-29 05:10:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-10-29 05:10:34,892 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 26 [2021-10-29 05:10:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:34,892 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-10-29 05:10:34,893 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-29 05:10:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-10-29 05:10:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:10:34,894 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:34,894 INFO L513 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-29 05:10:34,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:10:34,894 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-29 05:10:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1630670027, now seen corresponding path program 1 times [2021-10-29 05:10:34,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:34,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835764045] [2021-10-29 05:10:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:34,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:34,921 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-29 05:10:34,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:34,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835764045] [2021-10-29 05:10:34,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835764045] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:34,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:34,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:34,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062096108] [2021-10-29 05:10:34,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:34,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:34,926 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-29 05:10:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,041 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2021-10-29 05:10:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:35,041 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-29 05:10:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,043 INFO L225 Difference]: With dead ends: 245 [2021-10-29 05:10:35,043 INFO L226 Difference]: Without dead ends: 224 [2021-10-29 05:10:35,043 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-29 05:10:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-10-29 05:10:35,094 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-29 05:10:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2021-10-29 05:10:35,097 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 26 [2021-10-29 05:10:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,097 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2021-10-29 05:10:35,098 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-29 05:10:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2021-10-29 05:10:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:10:35,099 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,099 INFO L513 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-29 05:10:35,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:10:35,102 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-29 05:10:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -778334719, now seen corresponding path program 1 times [2021-10-29 05:10:35,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50179407] [2021-10-29 05:10:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:35,185 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-29 05:10:35,186 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:35,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50179407] [2021-10-29 05:10:35,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50179407] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:35,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:35,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:10:35,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868227447] [2021-10-29 05:10:35,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:35,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:35,188 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-29 05:10:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,301 INFO L93 Difference]: Finished difference Result 250 states and 297 transitions. [2021-10-29 05:10:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:35,301 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-29 05:10:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,304 INFO L225 Difference]: With dead ends: 250 [2021-10-29 05:10:35,304 INFO L226 Difference]: Without dead ends: 244 [2021-10-29 05:10:35,305 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-29 05:10:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 204. [2021-10-29 05:10:35,333 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-29 05:10:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2021-10-29 05:10:35,335 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 27 [2021-10-29 05:10:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,335 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2021-10-29 05:10:35,335 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-29 05:10:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2021-10-29 05:10:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:10:35,336 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,336 INFO L513 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-29 05:10:35,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:10:35,337 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-29 05:10:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash -971245594, now seen corresponding path program 1 times [2021-10-29 05:10:35,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501086527] [2021-10-29 05:10:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:35,414 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-29 05:10:35,414 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:35,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501086527] [2021-10-29 05:10:35,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501086527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:35,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:35,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:10:35,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829790352] [2021-10-29 05:10:35,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:10:35,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:10:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:35,417 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-29 05:10:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,547 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2021-10-29 05:10:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:10:35,548 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-29 05:10:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,549 INFO L225 Difference]: With dead ends: 221 [2021-10-29 05:10:35,549 INFO L226 Difference]: Without dead ends: 218 [2021-10-29 05:10:35,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:10:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-10-29 05:10:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2021-10-29 05:10:35,590 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-29 05:10:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2021-10-29 05:10:35,591 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 27 [2021-10-29 05:10:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,592 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2021-10-29 05:10:35,593 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-29 05:10:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2021-10-29 05:10:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:10:35,594 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,594 INFO L513 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-29 05:10:35,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:10:35,594 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-29 05:10:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -971257510, now seen corresponding path program 1 times [2021-10-29 05:10:35,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580452540] [2021-10-29 05:10:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:35,641 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-29 05:10:35,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:35,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580452540] [2021-10-29 05:10:35,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580452540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:35,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:35,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:35,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193819756] [2021-10-29 05:10:35,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:35,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:35,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:35,645 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-29 05:10:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,747 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2021-10-29 05:10:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:35,747 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-29 05:10:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,749 INFO L225 Difference]: With dead ends: 218 [2021-10-29 05:10:35,749 INFO L226 Difference]: Without dead ends: 199 [2021-10-29 05:10:35,749 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-29 05:10:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2021-10-29 05:10:35,772 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-29 05:10:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2021-10-29 05:10:35,773 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 27 [2021-10-29 05:10:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,773 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2021-10-29 05:10:35,773 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-29 05:10:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2021-10-29 05:10:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:10:35,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,774 INFO L513 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-29 05:10:35,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 05:10:35,775 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-29 05:10:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1445203115, now seen corresponding path program 1 times [2021-10-29 05:10:35,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55649630] [2021-10-29 05:10:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:35,801 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-29 05:10:35,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:35,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55649630] [2021-10-29 05:10:35,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55649630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:35,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:35,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:35,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976213353] [2021-10-29 05:10:35,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:35,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:35,806 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-29 05:10:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,840 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2021-10-29 05:10:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:35,841 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-29 05:10:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,844 INFO L225 Difference]: With dead ends: 217 [2021-10-29 05:10:35,844 INFO L226 Difference]: Without dead ends: 196 [2021-10-29 05:10:35,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-10-29 05:10:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2021-10-29 05:10:35,867 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-29 05:10:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2021-10-29 05:10:35,868 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 28 [2021-10-29 05:10:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,868 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2021-10-29 05:10:35,868 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-29 05:10:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2021-10-29 05:10:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 05:10:35,869 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,870 INFO L513 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-29 05:10:35,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 05:10:35,870 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-29 05:10:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1419537357, now seen corresponding path program 1 times [2021-10-29 05:10:35,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708919844] [2021-10-29 05:10:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:35,908 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-29 05:10:35,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:35,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708919844] [2021-10-29 05:10:35,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708919844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:35,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:35,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:10:35,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720982103] [2021-10-29 05:10:35,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:10:35,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:10:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:10:35,911 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-29 05:10:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:35,943 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2021-10-29 05:10:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:10:35,944 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-29 05:10:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:35,945 INFO L225 Difference]: With dead ends: 199 [2021-10-29 05:10:35,945 INFO L226 Difference]: Without dead ends: 183 [2021-10-29 05:10:35,946 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-10-29 05:10:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-10-29 05:10:35,985 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-29 05:10:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2021-10-29 05:10:35,986 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 30 [2021-10-29 05:10:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:35,986 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2021-10-29 05:10:35,986 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-29 05:10:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2021-10-29 05:10:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 05:10:35,987 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:35,987 INFO L513 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-29 05:10:35,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 05:10:35,988 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-29 05:10:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 826829468, now seen corresponding path program 1 times [2021-10-29 05:10:35,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:35,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488943500] [2021-10-29 05:10:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:35,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:36,026 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-29 05:10:36,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:36,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488943500] [2021-10-29 05:10:36,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488943500] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:36,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:36,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:10:36,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405412654] [2021-10-29 05:10:36,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:10:36,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:10:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:36,029 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-29 05:10:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:36,170 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2021-10-29 05:10:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:10:36,170 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-29 05:10:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:36,172 INFO L225 Difference]: With dead ends: 199 [2021-10-29 05:10:36,172 INFO L226 Difference]: Without dead ends: 153 [2021-10-29 05:10:36,172 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:10:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-10-29 05:10:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2021-10-29 05:10:36,189 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-29 05:10:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-10-29 05:10:36,190 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 30 [2021-10-29 05:10:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:36,191 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-10-29 05:10:36,191 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-29 05:10:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-10-29 05:10:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 05:10:36,192 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:36,192 INFO L513 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-29 05:10:36,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 05:10:36,193 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-29 05:10:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 59605634, now seen corresponding path program 1 times [2021-10-29 05:10:36,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:36,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794200803] [2021-10-29 05:10:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:36,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:36,278 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-29 05:10:36,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:36,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794200803] [2021-10-29 05:10:36,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794200803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:36,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:36,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 05:10:36,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383542987] [2021-10-29 05:10:36,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:10:36,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:36,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:10:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:10:36,281 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-29 05:10:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:36,551 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2021-10-29 05:10:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 05:10:36,552 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-29 05:10:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:36,555 INFO L225 Difference]: With dead ends: 176 [2021-10-29 05:10:36,555 INFO L226 Difference]: Without dead ends: 174 [2021-10-29 05:10:36,556 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:10:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-29 05:10:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2021-10-29 05:10:36,581 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-29 05:10:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2021-10-29 05:10:36,582 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 33 [2021-10-29 05:10:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:36,582 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2021-10-29 05:10:36,582 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-29 05:10:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2021-10-29 05:10:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:10:36,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:36,583 INFO L513 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-29 05:10:36,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 05:10:36,583 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-29 05:10:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1674195647, now seen corresponding path program 1 times [2021-10-29 05:10:36,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:36,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485216119] [2021-10-29 05:10:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:36,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:36,650 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-29 05:10:36,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:36,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485216119] [2021-10-29 05:10:36,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485216119] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:36,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:36,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:10:36,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527511109] [2021-10-29 05:10:36,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:10:36,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:10:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:10:36,653 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-29 05:10:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:36,783 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2021-10-29 05:10:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:10:36,784 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-29 05:10:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:36,785 INFO L225 Difference]: With dead ends: 170 [2021-10-29 05:10:36,785 INFO L226 Difference]: Without dead ends: 168 [2021-10-29 05:10:36,786 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-10-29 05:10:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2021-10-29 05:10:36,802 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-29 05:10:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2021-10-29 05:10:36,803 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 36 [2021-10-29 05:10:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:36,803 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-10-29 05:10:36,803 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-29 05:10:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2021-10-29 05:10:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 05:10:36,804 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:36,804 INFO L513 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-29 05:10:36,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 05:10:36,805 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-29 05:10:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 755581325, now seen corresponding path program 1 times [2021-10-29 05:10:36,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:36,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409995029] [2021-10-29 05:10:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:36,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:36,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-29 05:10:36,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:36,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409995029] [2021-10-29 05:10:36,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409995029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:36,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:36,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:10:36,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632996089] [2021-10-29 05:10:36,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:10:36,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:10:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:36,857 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-29 05:10:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:36,948 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2021-10-29 05:10:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:10:36,949 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-29 05:10:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:36,950 INFO L225 Difference]: With dead ends: 143 [2021-10-29 05:10:36,950 INFO L226 Difference]: Without dead ends: 125 [2021-10-29 05:10:36,950 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:10:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-29 05:10:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-10-29 05:10:36,967 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-29 05:10:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2021-10-29 05:10:36,968 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 37 [2021-10-29 05:10:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:36,968 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2021-10-29 05:10:36,968 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-29 05:10:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2021-10-29 05:10:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 05:10:36,969 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:36,969 INFO L513 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-29 05:10:36,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 05:10:36,970 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-29 05:10:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1257169994, now seen corresponding path program 1 times [2021-10-29 05:10:36,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:36,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633382544] [2021-10-29 05:10:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:36,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:37,056 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-29 05:10:37,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:37,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633382544] [2021-10-29 05:10:37,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633382544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:37,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:37,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:10:37,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604384462] [2021-10-29 05:10:37,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:10:37,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:10:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:10:37,059 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-29 05:10:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:37,192 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-10-29 05:10:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:10:37,193 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-29 05:10:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:37,194 INFO L225 Difference]: With dead ends: 141 [2021-10-29 05:10:37,194 INFO L226 Difference]: Without dead ends: 125 [2021-10-29 05:10:37,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 05:10:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-29 05:10:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-10-29 05:10:37,213 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-29 05:10:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-10-29 05:10:37,214 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 37 [2021-10-29 05:10:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:37,214 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-10-29 05:10:37,214 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-29 05:10:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-10-29 05:10:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 05:10:37,215 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:37,215 INFO L513 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-29 05:10:37,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 05:10:37,216 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-29 05:10:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1095271655, now seen corresponding path program 1 times [2021-10-29 05:10:37,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:37,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175999942] [2021-10-29 05:10:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:37,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:10:37,241 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-29 05:10:37,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:10:37,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175999942] [2021-10-29 05:10:37,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175999942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:10:37,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:10:37,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:10:37,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540870837] [2021-10-29 05:10:37,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:10:37,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:10:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:10:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:37,244 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-29 05:10:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:10:37,282 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2021-10-29 05:10:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:10:37,283 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-29 05:10:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:10:37,284 INFO L225 Difference]: With dead ends: 225 [2021-10-29 05:10:37,284 INFO L226 Difference]: Without dead ends: 155 [2021-10-29 05:10:37,285 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:10:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-29 05:10:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2021-10-29 05:10:37,304 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-29 05:10:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2021-10-29 05:10:37,304 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 38 [2021-10-29 05:10:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:10:37,305 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2021-10-29 05:10:37,305 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-29 05:10:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2021-10-29 05:10:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 05:10:37,306 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:10:37,306 INFO L513 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-29 05:10:37,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 05:10:37,307 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-29 05:10:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:10:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1099571465, now seen corresponding path program 1 times [2021-10-29 05:10:37,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:10:37,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406728387] [2021-10-29 05:10:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:10:37,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:10:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:10:37,324 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:10:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:10:37,383 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:10:37,383 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:10:37,384 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,391 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,392 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,394 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,394 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:10:37,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 05:10:37,397 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:10:37,401 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:10:37,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:10:37 BoogieIcfgContainer [2021-10-29 05:10:37,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:10:37,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:10:37,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:10:37,493 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:10:37,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:10:29" (3/4) ... [2021-10-29 05:10:37,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:10:37,652 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:10:37,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:10:37,654 INFO L168 Benchmark]: Toolchain (without parser) took 11045.56 ms. Allocated memory was 109.1 MB in the beginning and 272.6 MB in the end (delta: 163.6 MB). Free memory was 66.5 MB in the beginning and 140.9 MB in the end (delta: -74.4 MB). Peak memory consumption was 88.7 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,654 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 109.1 MB. Free memory is still 84.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:10:37,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.00 ms. Allocated memory is still 109.1 MB. Free memory was 66.3 MB in the beginning and 73.6 MB in the end (delta: -7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.40 ms. Allocated memory is still 109.1 MB. Free memory was 73.6 MB in the beginning and 66.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,656 INFO L168 Benchmark]: Boogie Preprocessor took 96.98 ms. Allocated memory is still 109.1 MB. Free memory was 66.0 MB in the beginning and 61.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,656 INFO L168 Benchmark]: RCFGBuilder took 2361.92 ms. Allocated memory was 109.1 MB in the beginning and 144.7 MB in the end (delta: 35.7 MB). Free memory was 61.0 MB in the beginning and 106.6 MB in the end (delta: -45.7 MB). Peak memory consumption was 52.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,657 INFO L168 Benchmark]: TraceAbstraction took 7675.55 ms. Allocated memory was 144.7 MB in the beginning and 272.6 MB in the end (delta: 127.9 MB). Free memory was 106.6 MB in the beginning and 154.5 MB in the end (delta: -47.9 MB). Peak memory consumption was 80.0 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,657 INFO L168 Benchmark]: Witness Printer took 159.49 ms. Allocated memory is still 272.6 MB. Free memory was 154.5 MB in the beginning and 140.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-29 05:10:37,660 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.21 ms. Allocated memory is still 109.1 MB. Free memory is still 84.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 618.00 ms. Allocated memory is still 109.1 MB. Free memory was 66.3 MB in the beginning and 73.6 MB in the end (delta: -7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 124.40 ms. Allocated memory is still 109.1 MB. Free memory was 73.6 MB in the beginning and 66.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 96.98 ms. Allocated memory is still 109.1 MB. Free memory was 66.0 MB in the beginning and 61.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2361.92 ms. Allocated memory was 109.1 MB in the beginning and 144.7 MB in the end (delta: 35.7 MB). Free memory was 61.0 MB in the beginning and 106.6 MB in the end (delta: -45.7 MB). Peak memory consumption was 52.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7675.55 ms. Allocated memory was 144.7 MB in the beginning and 272.6 MB in the end (delta: 127.9 MB). Free memory was 106.6 MB in the beginning and 154.5 MB in the end (delta: -47.9 MB). Peak memory consumption was 80.0 MB. Max. memory is 16.1 GB. * Witness Printer took 159.49 ms. Allocated memory is still 272.6 MB. Free memory was 154.5 MB in the beginning and 140.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 7.5s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7035 SDtfs, 4766 SDslu, 6893 SDs, 0 SdLazy, 2787 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 612 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s 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-29 05:10:37,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30e36c2f-4a8a-4256-ab15-81afe9fa8ca6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...