./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan --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 f621ab4908749e263e6fb16e731498fd137a7d6c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.0-7b2dab5 [2020-12-03 12:32:07,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 12:32:07,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 12:32:07,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 12:32:07,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 12:32:07,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 12:32:07,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 12:32:07,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 12:32:07,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 12:32:07,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 12:32:07,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 12:32:07,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 12:32:07,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 12:32:07,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 12:32:07,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 12:32:07,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 12:32:07,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 12:32:07,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 12:32:07,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 12:32:07,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 12:32:07,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 12:32:07,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 12:32:07,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 12:32:07,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 12:32:07,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 12:32:07,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 12:32:07,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 12:32:07,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 12:32:07,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 12:32:07,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 12:32:07,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 12:32:07,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 12:32:07,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 12:32:07,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 12:32:07,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 12:32:07,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 12:32:07,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 12:32:07,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 12:32:07,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 12:32:07,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 12:32:07,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 12:32:07,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-03 12:32:07,652 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 12:32:07,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 12:32:07,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-03 12:32:07,653 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-03 12:32:07,654 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-03 12:32:07,654 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-03 12:32:07,654 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-03 12:32:07,654 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-03 12:32:07,655 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-03 12:32:07,655 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-03 12:32:07,655 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-03 12:32:07,655 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-03 12:32:07,656 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-03 12:32:07,656 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-03 12:32:07,656 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-03 12:32:07,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 12:32:07,657 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 12:32:07,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 12:32:07,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 12:32:07,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 12:32:07,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 12:32:07,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 12:32:07,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 12:32:07,659 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-03 12:32:07,659 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 12:32:07,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 12:32:07,659 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 12:32:07,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 12:32:07,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 12:32:07,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 12:32:07,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:32:07,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 12:32:07,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 12:32:07,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 12:32:07,661 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-03 12:32:07,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 12:32:07,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 12:32:07,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 12:32:07,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 12:32:07,662 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-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/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-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan 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 -> f621ab4908749e263e6fb16e731498fd137a7d6c [2020-12-03 12:32:07,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 12:32:07,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 12:32:07,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 12:32:07,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 12:32:07,949 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 12:32:07,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-03 12:32:08,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/data/923d3815e/f3bc84a7375440d8892a347339dbe644/FLAG2003b43fb [2020-12-03 12:32:08,494 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 12:32:08,495 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-03 12:32:08,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/data/923d3815e/f3bc84a7375440d8892a347339dbe644/FLAG2003b43fb [2020-12-03 12:32:08,852 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/data/923d3815e/f3bc84a7375440d8892a347339dbe644 [2020-12-03 12:32:08,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 12:32:08,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 12:32:08,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 12:32:08,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 12:32:08,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 12:32:08,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:32:08" (1/1) ... [2020-12-03 12:32:08,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b2d3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:08, skipping insertion in model container [2020-12-03 12:32:08,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:32:08" (1/1) ... [2020-12-03 12:32:08,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 12:32:08,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 12:32:09,245 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2020-12-03 12:32:09,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:32:09,262 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 12:32:09,334 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2020-12-03 12:32:09,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:32:09,356 INFO L208 MainTranslator]: Completed translation [2020-12-03 12:32:09,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09 WrapperNode [2020-12-03 12:32:09,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 12:32:09,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 12:32:09,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 12:32:09,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 12:32:09,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 12:32:09,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 12:32:09,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 12:32:09,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 12:32:09,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... [2020-12-03 12:32:09,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 12:32:09,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 12:32:09,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 12:32:09,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 12:32:09,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:32:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 12:32:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 12:32:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 12:32:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 12:32:11,863 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 12:32:11,863 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2020-12-03 12:32:11,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:32:11 BoogieIcfgContainer [2020-12-03 12:32:11,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 12:32:11,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 12:32:11,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 12:32:11,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 12:32:11,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:32:08" (1/3) ... [2020-12-03 12:32:11,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328df808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:32:11, skipping insertion in model container [2020-12-03 12:32:11,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:32:09" (2/3) ... [2020-12-03 12:32:11,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328df808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:32:11, skipping insertion in model container [2020-12-03 12:32:11,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:32:11" (3/3) ... [2020-12-03 12:32:11,877 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-12-03 12:32:11,894 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 12:32:11,899 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-03 12:32:11,911 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-03 12:32:11,951 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 12:32:11,951 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 12:32:11,951 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 12:32:11,952 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 12:32:11,952 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 12:32:11,952 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 12:32:11,952 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 12:32:11,952 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 12:32:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2020-12-03 12:32:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 12:32:11,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:11,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:32:11,986 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1628696268, now seen corresponding path program 1 times [2020-12-03 12:32:12,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:12,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571783366] [2020-12-03 12:32:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:12,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571783366] [2020-12-03 12:32:12,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:12,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:12,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862520292] [2020-12-03 12:32:12,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:12,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:12,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:12,361 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2020-12-03 12:32:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:12,508 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2020-12-03 12:32:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:12,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-03 12:32:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:12,533 INFO L225 Difference]: With dead ends: 477 [2020-12-03 12:32:12,534 INFO L226 Difference]: Without dead ends: 238 [2020-12-03 12:32:12,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-12-03 12:32:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-12-03 12:32:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-03 12:32:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-12-03 12:32:12,618 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2020-12-03 12:32:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:12,619 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-12-03 12:32:12,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-12-03 12:32:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 12:32:12,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:12,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:32:12,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 12:32:12,622 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1565212023, now seen corresponding path program 1 times [2020-12-03 12:32:12,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:12,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716113251] [2020-12-03 12:32:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:12,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716113251] [2020-12-03 12:32:12,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:12,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:32:12,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636172032] [2020-12-03 12:32:12,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:32:12,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:32:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:12,821 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 6 states. [2020-12-03 12:32:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:12,931 INFO L93 Difference]: Finished difference Result 664 states and 967 transitions. [2020-12-03 12:32:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:32:12,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-03 12:32:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:12,936 INFO L225 Difference]: With dead ends: 664 [2020-12-03 12:32:12,936 INFO L226 Difference]: Without dead ends: 452 [2020-12-03 12:32:12,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-03 12:32:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 235. [2020-12-03 12:32:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-12-03 12:32:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2020-12-03 12:32:12,989 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2020-12-03 12:32:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:12,989 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2020-12-03 12:32:12,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:32:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2020-12-03 12:32:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-03 12:32:12,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:12,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:32:12,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 12:32:12,991 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash -123787735, now seen corresponding path program 1 times [2020-12-03 12:32:12,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:12,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057197158] [2020-12-03 12:32:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:13,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057197158] [2020-12-03 12:32:13,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:13,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:32:13,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898828788] [2020-12-03 12:32:13,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:32:13,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:32:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:32:13,061 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2020-12-03 12:32:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:13,176 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2020-12-03 12:32:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 12:32:13,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-03 12:32:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:13,182 INFO L225 Difference]: With dead ends: 861 [2020-12-03 12:32:13,182 INFO L226 Difference]: Without dead ends: 649 [2020-12-03 12:32:13,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 12:32:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-12-03 12:32:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2020-12-03 12:32:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-03 12:32:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2020-12-03 12:32:13,200 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2020-12-03 12:32:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:13,201 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2020-12-03 12:32:13,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:32:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2020-12-03 12:32:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 12:32:13,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:13,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:32:13,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 12:32:13,203 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1130743666, now seen corresponding path program 1 times [2020-12-03 12:32:13,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:13,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417373323] [2020-12-03 12:32:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417373323] [2020-12-03 12:32:13,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:13,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:32:13,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051036905] [2020-12-03 12:32:13,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:32:13,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:32:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:13,350 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 6 states. [2020-12-03 12:32:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:13,464 INFO L93 Difference]: Finished difference Result 667 states and 970 transitions. [2020-12-03 12:32:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:32:13,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-03 12:32:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:13,468 INFO L225 Difference]: With dead ends: 667 [2020-12-03 12:32:13,468 INFO L226 Difference]: Without dead ends: 455 [2020-12-03 12:32:13,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-12-03 12:32:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 237. [2020-12-03 12:32:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-12-03 12:32:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 345 transitions. [2020-12-03 12:32:13,485 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 345 transitions. Word has length 18 [2020-12-03 12:32:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:13,486 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 345 transitions. [2020-12-03 12:32:13,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:32:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 345 transitions. [2020-12-03 12:32:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 12:32:13,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:13,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:32:13,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 12:32:13,489 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash -372278167, now seen corresponding path program 1 times [2020-12-03 12:32:13,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:13,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015472964] [2020-12-03 12:32:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:13,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015472964] [2020-12-03 12:32:13,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:13,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:13,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457027275] [2020-12-03 12:32:13,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:13,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:13,606 INFO L87 Difference]: Start difference. First operand 237 states and 345 transitions. Second operand 3 states. [2020-12-03 12:32:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:13,637 INFO L93 Difference]: Finished difference Result 477 states and 696 transitions. [2020-12-03 12:32:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-03 12:32:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:13,639 INFO L225 Difference]: With dead ends: 477 [2020-12-03 12:32:13,640 INFO L226 Difference]: Without dead ends: 265 [2020-12-03 12:32:13,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-12-03 12:32:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2020-12-03 12:32:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-03 12:32:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 337 transitions. [2020-12-03 12:32:13,653 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 337 transitions. Word has length 18 [2020-12-03 12:32:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:13,653 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 337 transitions. [2020-12-03 12:32:13,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 337 transitions. [2020-12-03 12:32:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:32:13,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:13,659 INFO L422 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] [2020-12-03 12:32:13,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 12:32:13,660 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash 76498753, now seen corresponding path program 1 times [2020-12-03 12:32:13,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:13,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641354744] [2020-12-03 12:32:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:13,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641354744] [2020-12-03 12:32:13,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:13,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:13,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338813193] [2020-12-03 12:32:13,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:13,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:13,758 INFO L87 Difference]: Start difference. First operand 232 states and 337 transitions. Second operand 3 states. [2020-12-03 12:32:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:13,828 INFO L93 Difference]: Finished difference Result 476 states and 695 transitions. [2020-12-03 12:32:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:13,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-03 12:32:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:13,834 INFO L225 Difference]: With dead ends: 476 [2020-12-03 12:32:13,834 INFO L226 Difference]: Without dead ends: 269 [2020-12-03 12:32:13,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-03 12:32:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2020-12-03 12:32:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-03 12:32:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2020-12-03 12:32:13,846 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 22 [2020-12-03 12:32:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:13,852 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2020-12-03 12:32:13,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2020-12-03 12:32:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 12:32:13,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:13,854 INFO L422 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] [2020-12-03 12:32:13,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 12:32:13,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -766771815, now seen corresponding path program 1 times [2020-12-03 12:32:13,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:13,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696025864] [2020-12-03 12:32:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:13,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696025864] [2020-12-03 12:32:13,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:13,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:13,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718812661] [2020-12-03 12:32:13,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:13,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:13,956 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand 3 states. [2020-12-03 12:32:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:14,015 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2020-12-03 12:32:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:14,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-03 12:32:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:14,017 INFO L225 Difference]: With dead ends: 444 [2020-12-03 12:32:14,018 INFO L226 Difference]: Without dead ends: 257 [2020-12-03 12:32:14,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-12-03 12:32:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 200. [2020-12-03 12:32:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-03 12:32:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2020-12-03 12:32:14,029 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 26 [2020-12-03 12:32:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:14,030 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2020-12-03 12:32:14,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2020-12-03 12:32:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-03 12:32:14,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:14,049 INFO L422 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] [2020-12-03 12:32:14,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-03 12:32:14,049 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:14,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2009439771, now seen corresponding path program 1 times [2020-12-03 12:32:14,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:14,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800201697] [2020-12-03 12:32:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800201697] [2020-12-03 12:32:14,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:14,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:14,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737132061] [2020-12-03 12:32:14,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:14,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:14,132 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand 3 states. [2020-12-03 12:32:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:14,219 INFO L93 Difference]: Finished difference Result 440 states and 631 transitions. [2020-12-03 12:32:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:14,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-03 12:32:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:14,222 INFO L225 Difference]: With dead ends: 440 [2020-12-03 12:32:14,222 INFO L226 Difference]: Without dead ends: 265 [2020-12-03 12:32:14,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-12-03 12:32:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 180. [2020-12-03 12:32:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-03 12:32:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 255 transitions. [2020-12-03 12:32:14,235 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 255 transitions. Word has length 27 [2020-12-03 12:32:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:14,237 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 255 transitions. [2020-12-03 12:32:14,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 255 transitions. [2020-12-03 12:32:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-03 12:32:14,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:14,240 INFO L422 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] [2020-12-03 12:32:14,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-03 12:32:14,240 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash 86559853, now seen corresponding path program 1 times [2020-12-03 12:32:14,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:14,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455148402] [2020-12-03 12:32:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:14,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455148402] [2020-12-03 12:32:14,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:14,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:32:14,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889463046] [2020-12-03 12:32:14,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:32:14,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:32:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:32:14,453 INFO L87 Difference]: Start difference. First operand 180 states and 255 transitions. Second operand 4 states. [2020-12-03 12:32:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:14,500 INFO L93 Difference]: Finished difference Result 512 states and 717 transitions. [2020-12-03 12:32:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 12:32:14,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-03 12:32:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:14,503 INFO L225 Difference]: With dead ends: 512 [2020-12-03 12:32:14,503 INFO L226 Difference]: Without dead ends: 342 [2020-12-03 12:32:14,504 INFO L677 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 [2020-12-03 12:32:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-12-03 12:32:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 184. [2020-12-03 12:32:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-12-03 12:32:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2020-12-03 12:32:14,518 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 259 transitions. Word has length 32 [2020-12-03 12:32:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:14,518 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 259 transitions. [2020-12-03 12:32:14,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:32:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2020-12-03 12:32:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-03 12:32:14,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:14,524 INFO L422 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] [2020-12-03 12:32:14,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-03 12:32:14,525 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash -137756106, now seen corresponding path program 1 times [2020-12-03 12:32:14,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:14,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015382369] [2020-12-03 12:32:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:14,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015382369] [2020-12-03 12:32:14,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:14,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:32:14,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272758741] [2020-12-03 12:32:14,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:32:14,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:32:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:14,701 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. Second operand 6 states. [2020-12-03 12:32:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:14,944 INFO L93 Difference]: Finished difference Result 629 states and 873 transitions. [2020-12-03 12:32:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:32:14,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-12-03 12:32:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:14,948 INFO L225 Difference]: With dead ends: 629 [2020-12-03 12:32:14,948 INFO L226 Difference]: Without dead ends: 472 [2020-12-03 12:32:14,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-03 12:32:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-12-03 12:32:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 219. [2020-12-03 12:32:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-12-03 12:32:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2020-12-03 12:32:14,968 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 34 [2020-12-03 12:32:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:14,972 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2020-12-03 12:32:14,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:32:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2020-12-03 12:32:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-03 12:32:14,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:14,973 INFO L422 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] [2020-12-03 12:32:14,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-03 12:32:14,974 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1582358541, now seen corresponding path program 1 times [2020-12-03 12:32:14,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:14,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476306183] [2020-12-03 12:32:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:15,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476306183] [2020-12-03 12:32:15,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:15,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:15,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957423658] [2020-12-03 12:32:15,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:15,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:15,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:15,065 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand 3 states. [2020-12-03 12:32:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:15,129 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2020-12-03 12:32:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:15,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-03 12:32:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:15,132 INFO L225 Difference]: With dead ends: 399 [2020-12-03 12:32:15,132 INFO L226 Difference]: Without dead ends: 242 [2020-12-03 12:32:15,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-03 12:32:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2020-12-03 12:32:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-12-03 12:32:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2020-12-03 12:32:15,150 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 35 [2020-12-03 12:32:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:15,153 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2020-12-03 12:32:15,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2020-12-03 12:32:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-03 12:32:15,154 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:15,155 INFO L422 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] [2020-12-03 12:32:15,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-03 12:32:15,157 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash 702778323, now seen corresponding path program 1 times [2020-12-03 12:32:15,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:15,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320199501] [2020-12-03 12:32:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:15,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320199501] [2020-12-03 12:32:15,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:15,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:15,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880259220] [2020-12-03 12:32:15,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:32:15,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:32:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:15,229 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 3 states. [2020-12-03 12:32:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:15,296 INFO L93 Difference]: Finished difference Result 457 states and 637 transitions. [2020-12-03 12:32:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:32:15,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-03 12:32:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:15,299 INFO L225 Difference]: With dead ends: 457 [2020-12-03 12:32:15,299 INFO L226 Difference]: Without dead ends: 287 [2020-12-03 12:32:15,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:32:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-03 12:32:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2020-12-03 12:32:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-03 12:32:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2020-12-03 12:32:15,321 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 35 [2020-12-03 12:32:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:15,321 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2020-12-03 12:32:15,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:32:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2020-12-03 12:32:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-03 12:32:15,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:15,323 INFO L422 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] [2020-12-03 12:32:15,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-03 12:32:15,323 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1960309012, now seen corresponding path program 1 times [2020-12-03 12:32:15,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:15,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481044508] [2020-12-03 12:32:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:15,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481044508] [2020-12-03 12:32:15,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:15,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:32:15,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080825271] [2020-12-03 12:32:15,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:32:15,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:32:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:32:15,403 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand 4 states. [2020-12-03 12:32:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:15,529 INFO L93 Difference]: Finished difference Result 632 states and 866 transitions. [2020-12-03 12:32:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:32:15,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-03 12:32:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:15,534 INFO L225 Difference]: With dead ends: 632 [2020-12-03 12:32:15,534 INFO L226 Difference]: Without dead ends: 481 [2020-12-03 12:32:15,539 INFO L677 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 [2020-12-03 12:32:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-03 12:32:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 315. [2020-12-03 12:32:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-03 12:32:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 427 transitions. [2020-12-03 12:32:15,567 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 427 transitions. Word has length 38 [2020-12-03 12:32:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:15,567 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 427 transitions. [2020-12-03 12:32:15,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:32:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 427 transitions. [2020-12-03 12:32:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-03 12:32:15,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:15,568 INFO L422 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] [2020-12-03 12:32:15,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-03 12:32:15,569 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash -604017043, now seen corresponding path program 1 times [2020-12-03 12:32:15,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:15,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270528929] [2020-12-03 12:32:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:15,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270528929] [2020-12-03 12:32:15,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:15,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 12:32:15,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676578031] [2020-12-03 12:32:15,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 12:32:15,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 12:32:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-03 12:32:15,714 INFO L87 Difference]: Start difference. First operand 315 states and 427 transitions. Second operand 7 states. [2020-12-03 12:32:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:16,207 INFO L93 Difference]: Finished difference Result 1175 states and 1601 transitions. [2020-12-03 12:32:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:32:16,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-12-03 12:32:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:16,213 INFO L225 Difference]: With dead ends: 1175 [2020-12-03 12:32:16,214 INFO L226 Difference]: Without dead ends: 937 [2020-12-03 12:32:16,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-03 12:32:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2020-12-03 12:32:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 368. [2020-12-03 12:32:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-12-03 12:32:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 498 transitions. [2020-12-03 12:32:16,256 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 498 transitions. Word has length 38 [2020-12-03 12:32:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:16,257 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 498 transitions. [2020-12-03 12:32:16,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 12:32:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 498 transitions. [2020-12-03 12:32:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-03 12:32:16,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:16,258 INFO L422 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] [2020-12-03 12:32:16,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-03 12:32:16,258 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1082465882, now seen corresponding path program 1 times [2020-12-03 12:32:16,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:16,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221213895] [2020-12-03 12:32:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:16,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221213895] [2020-12-03 12:32:16,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:16,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:32:16,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238259020] [2020-12-03 12:32:16,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:32:16,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:16,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:32:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:32:16,364 INFO L87 Difference]: Start difference. First operand 368 states and 498 transitions. Second operand 5 states. [2020-12-03 12:32:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:16,597 INFO L93 Difference]: Finished difference Result 761 states and 1035 transitions. [2020-12-03 12:32:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 12:32:16,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-03 12:32:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:16,602 INFO L225 Difference]: With dead ends: 761 [2020-12-03 12:32:16,603 INFO L226 Difference]: Without dead ends: 759 [2020-12-03 12:32:16,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 12:32:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-12-03 12:32:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 370. [2020-12-03 12:32:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-12-03 12:32:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 500 transitions. [2020-12-03 12:32:16,648 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 500 transitions. Word has length 39 [2020-12-03 12:32:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:16,648 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 500 transitions. [2020-12-03 12:32:16,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:32:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 500 transitions. [2020-12-03 12:32:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-03 12:32:16,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:16,650 INFO L422 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] [2020-12-03 12:32:16,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-03 12:32:16,650 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1098196191, now seen corresponding path program 1 times [2020-12-03 12:32:16,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:16,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438997873] [2020-12-03 12:32:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:16,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438997873] [2020-12-03 12:32:16,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:16,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:32:16,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220422100] [2020-12-03 12:32:16,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:32:16,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:32:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:16,811 INFO L87 Difference]: Start difference. First operand 370 states and 500 transitions. Second operand 6 states. [2020-12-03 12:32:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:17,149 INFO L93 Difference]: Finished difference Result 1165 states and 1588 transitions. [2020-12-03 12:32:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:32:17,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-12-03 12:32:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:17,155 INFO L225 Difference]: With dead ends: 1165 [2020-12-03 12:32:17,155 INFO L226 Difference]: Without dead ends: 923 [2020-12-03 12:32:17,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-03 12:32:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2020-12-03 12:32:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 374. [2020-12-03 12:32:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-12-03 12:32:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 505 transitions. [2020-12-03 12:32:17,202 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 505 transitions. Word has length 39 [2020-12-03 12:32:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:17,202 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 505 transitions. [2020-12-03 12:32:17,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:32:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 505 transitions. [2020-12-03 12:32:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:32:17,203 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:17,203 INFO L422 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, 1] [2020-12-03 12:32:17,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-03 12:32:17,204 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 390899289, now seen corresponding path program 1 times [2020-12-03 12:32:17,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:17,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699274798] [2020-12-03 12:32:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:17,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699274798] [2020-12-03 12:32:17,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:17,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:32:17,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107548740] [2020-12-03 12:32:17,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:32:17,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:32:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:32:17,238 INFO L87 Difference]: Start difference. First operand 374 states and 505 transitions. Second operand 4 states. [2020-12-03 12:32:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:17,337 INFO L93 Difference]: Finished difference Result 834 states and 1119 transitions. [2020-12-03 12:32:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:32:17,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-03 12:32:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:17,341 INFO L225 Difference]: With dead ends: 834 [2020-12-03 12:32:17,341 INFO L226 Difference]: Without dead ends: 492 [2020-12-03 12:32:17,342 INFO L677 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 [2020-12-03 12:32:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-12-03 12:32:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 328. [2020-12-03 12:32:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-12-03 12:32:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 438 transitions. [2020-12-03 12:32:17,383 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 438 transitions. Word has length 40 [2020-12-03 12:32:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:17,383 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 438 transitions. [2020-12-03 12:32:17,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:32:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 438 transitions. [2020-12-03 12:32:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:32:17,384 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:17,385 INFO L422 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, 1] [2020-12-03 12:32:17,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-03 12:32:17,385 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1229637880, now seen corresponding path program 1 times [2020-12-03 12:32:17,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:17,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454557275] [2020-12-03 12:32:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:17,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454557275] [2020-12-03 12:32:17,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:17,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 12:32:17,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481735456] [2020-12-03 12:32:17,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:32:17,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:32:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:32:17,533 INFO L87 Difference]: Start difference. First operand 328 states and 438 transitions. Second operand 6 states. [2020-12-03 12:32:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:17,715 INFO L93 Difference]: Finished difference Result 723 states and 1003 transitions. [2020-12-03 12:32:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:32:17,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-12-03 12:32:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:17,719 INFO L225 Difference]: With dead ends: 723 [2020-12-03 12:32:17,719 INFO L226 Difference]: Without dead ends: 481 [2020-12-03 12:32:17,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-03 12:32:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-03 12:32:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 324. [2020-12-03 12:32:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-03 12:32:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2020-12-03 12:32:17,766 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 40 [2020-12-03 12:32:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:17,767 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2020-12-03 12:32:17,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:32:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2020-12-03 12:32:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:32:17,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:17,768 INFO L422 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, 1] [2020-12-03 12:32:17,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-03 12:32:17,768 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 192835145, now seen corresponding path program 1 times [2020-12-03 12:32:17,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:17,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852177772] [2020-12-03 12:32:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:32:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:32:17,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852177772] [2020-12-03 12:32:17,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:32:17,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 12:32:17,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63668524] [2020-12-03 12:32:17,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 12:32:17,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:32:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 12:32:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-03 12:32:17,918 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand 7 states. [2020-12-03 12:32:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:32:18,447 INFO L93 Difference]: Finished difference Result 1537 states and 2046 transitions. [2020-12-03 12:32:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:32:18,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-03 12:32:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:32:18,456 INFO L225 Difference]: With dead ends: 1537 [2020-12-03 12:32:18,456 INFO L226 Difference]: Without dead ends: 1281 [2020-12-03 12:32:18,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-03 12:32:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2020-12-03 12:32:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 404. [2020-12-03 12:32:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-12-03 12:32:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 531 transitions. [2020-12-03 12:32:18,523 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 531 transitions. Word has length 40 [2020-12-03 12:32:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:32:18,523 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 531 transitions. [2020-12-03 12:32:18,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 12:32:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 531 transitions. [2020-12-03 12:32:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-03 12:32:18,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:32:18,525 INFO L422 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, 1, 1, 1] [2020-12-03 12:32:18,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-03 12:32:18,525 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:32:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:32:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1659677141, now seen corresponding path program 1 times [2020-12-03 12:32:18,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:32:18,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056400536] [2020-12-03 12:32:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:32:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:32:18,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:32:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:32:18,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:32:18,679 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-03 12:32:18,679 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 12:32:18,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-03 12:32:18,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:32:18 BoogieIcfgContainer [2020-12-03 12:32:18,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 12:32:18,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 12:32:18,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 12:32:18,847 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 12:32:18,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:32:11" (3/4) ... [2020-12-03 12:32:18,850 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 12:32:19,021 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c2fdd42-853f-4304-94a4-394ee9a7aca1/bin/utaipan/witness.graphml [2020-12-03 12:32:19,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 12:32:19,023 INFO L168 Benchmark]: Toolchain (without parser) took 10162.27 ms. Allocated memory was 109.1 MB in the beginning and 224.4 MB in the end (delta: 115.3 MB). Free memory was 75.0 MB in the beginning and 189.2 MB in the end (delta: -114.2 MB). Peak memory consumption was 127.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,024 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 109.1 MB. Free memory was 81.0 MB in the beginning and 81.0 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 12:32:19,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.80 ms. Allocated memory is still 109.1 MB. Free memory was 74.7 MB in the beginning and 78.6 MB in the end (delta: -3.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.44 ms. Allocated memory is still 109.1 MB. Free memory was 78.6 MB in the beginning and 73.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,025 INFO L168 Benchmark]: Boogie Preprocessor took 118.15 ms. Allocated memory is still 109.1 MB. Free memory was 73.9 MB in the beginning and 70.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,026 INFO L168 Benchmark]: RCFGBuilder took 2275.75 ms. Allocated memory was 109.1 MB in the beginning and 136.3 MB in the end (delta: 27.3 MB). Free memory was 70.2 MB in the beginning and 107.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 57.3 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,026 INFO L168 Benchmark]: TraceAbstraction took 6976.86 ms. Allocated memory was 136.3 MB in the beginning and 224.4 MB in the end (delta: 88.1 MB). Free memory was 107.2 MB in the beginning and 76.3 MB in the end (delta: 31.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,026 INFO L168 Benchmark]: Witness Printer took 174.52 ms. Allocated memory is still 224.4 MB. Free memory was 76.3 MB in the beginning and 189.2 MB in the end (delta: -112.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 16.1 GB. [2020-12-03 12:32:19,028 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.26 ms. Allocated memory is still 109.1 MB. Free memory was 81.0 MB in the beginning and 81.0 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 492.80 ms. Allocated memory is still 109.1 MB. Free memory was 74.7 MB in the beginning and 78.6 MB in the end (delta: -3.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 115.44 ms. Allocated memory is still 109.1 MB. Free memory was 78.6 MB in the beginning and 73.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 118.15 ms. Allocated memory is still 109.1 MB. Free memory was 73.9 MB in the beginning and 70.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2275.75 ms. Allocated memory was 109.1 MB in the beginning and 136.3 MB in the end (delta: 27.3 MB). Free memory was 70.2 MB in the beginning and 107.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 57.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6976.86 ms. Allocated memory was 136.3 MB in the beginning and 224.4 MB in the end (delta: 88.1 MB). Free memory was 107.2 MB in the beginning and 76.3 MB in the end (delta: 31.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 16.1 GB. * Witness Printer took 174.52 ms. Allocated memory is still 224.4 MB. Free memory was 76.3 MB in the beginning and 189.2 MB in the end (delta: -112.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] i2 = init() [L58] COND FALSE !(!cond) [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 [L58] COND FALSE !(!cond) [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L604] c1 = check() [L617] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 238 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6281 SDtfs, 7920 SDslu, 12389 SDs, 0 SdLazy, 883 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 4502 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 63105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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! Received shutdown request...