./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu2.cil.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_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/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 bcaab56def91d08648015d5637379998052b8de3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-09 16:44:49,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:44:49,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:44:50,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:44:50,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:44:50,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:44:50,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:44:50,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:44:50,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:44:50,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:44:50,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:44:50,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:44:50,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:44:50,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:44:50,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:44:50,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:44:50,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:44:50,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:44:50,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:44:50,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:44:50,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:44:50,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:44:50,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:44:50,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:44:50,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:44:50,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:44:50,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:44:50,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:44:50,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:44:50,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:44:50,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:44:50,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:44:50,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:44:50,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:44:50,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:44:50,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:44:50,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:44:50,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:44:50,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:44:50,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:44:50,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:44:50,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 16:44:50,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:44:50,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:44:50,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:44:50,060 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:44:50,060 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:44:50,060 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:44:50,061 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 16:44:50,061 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 16:44:50,062 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 16:44:50,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:44:50,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 16:44:50,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:44:50,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:44:50,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 16:44:50,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:44:50,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:44:50,075 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_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/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_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/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 -> bcaab56def91d08648015d5637379998052b8de3 [2020-12-09 16:44:50,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:44:50,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:44:50,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:44:50,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:44:50,301 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:44:50,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/../../sv-benchmarks/c/systemc/kundu2.cil.c [2020-12-09 16:44:50,342 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/data/157a8524c/9caf1ddbc45b41fe8ef1135c859605a5/FLAG5d4e01f27 [2020-12-09 16:44:50,705 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:44:50,705 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/sv-benchmarks/c/systemc/kundu2.cil.c [2020-12-09 16:44:50,712 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/data/157a8524c/9caf1ddbc45b41fe8ef1135c859605a5/FLAG5d4e01f27 [2020-12-09 16:44:50,722 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/data/157a8524c/9caf1ddbc45b41fe8ef1135c859605a5 [2020-12-09 16:44:50,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:44:50,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:44:50,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:44:50,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:44:50,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:44:50,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:50,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7939d932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50, skipping insertion in model container [2020-12-09 16:44:50,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:50,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:44:50,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:44:50,870 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_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/sv-benchmarks/c/systemc/kundu2.cil.c[331,344] [2020-12-09 16:44:50,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:44:50,949 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:44:50,957 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_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/sv-benchmarks/c/systemc/kundu2.cil.c[331,344] [2020-12-09 16:44:50,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:44:50,992 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:44:50,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50 WrapperNode [2020-12-09 16:44:50,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:44:50,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:44:50,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:44:50,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:44:50,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:44:51,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:44:51,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:44:51,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:44:51,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... [2020-12-09 16:44:51,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:44:51,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:44:51,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:44:51,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:44:51,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/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-09 16:44:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:44:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 16:44:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:44:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:44:51,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:44:51,937 INFO L299 CfgBuilder]: Removed 95 assume(true) statements. [2020-12-09 16:44:51,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:44:51 BoogieIcfgContainer [2020-12-09 16:44:51,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:44:51,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:44:51,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:44:51,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:44:51,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:44:50" (1/3) ... [2020-12-09 16:44:51,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6dba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:44:51, skipping insertion in model container [2020-12-09 16:44:51,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:44:50" (2/3) ... [2020-12-09 16:44:51,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6dba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:44:51, skipping insertion in model container [2020-12-09 16:44:51,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:44:51" (3/3) ... [2020-12-09 16:44:51,944 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2020-12-09 16:44:51,954 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:44:51,957 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-09 16:44:51,964 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-12-09 16:44:51,981 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:44:51,981 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 16:44:51,981 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:44:51,981 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:44:51,981 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:44:51,981 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:44:51,982 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:44:51,982 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:44:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-12-09 16:44:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 16:44:51,996 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:51,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:51,997 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1809132846, now seen corresponding path program 1 times [2020-12-09 16:44:52,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:52,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837940861] [2020-12-09 16:44:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:52,122 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-09 16:44:52,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837940861] [2020-12-09 16:44:52,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:52,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:44:52,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426444030] [2020-12-09 16:44:52,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:44:52,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:44:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:44:52,137 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2020-12-09 16:44:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:52,180 INFO L93 Difference]: Finished difference Result 275 states and 428 transitions. [2020-12-09 16:44:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:44:52,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-09 16:44:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:52,189 INFO L225 Difference]: With dead ends: 275 [2020-12-09 16:44:52,189 INFO L226 Difference]: Without dead ends: 177 [2020-12-09 16:44:52,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:44:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-09 16:44:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2020-12-09 16:44:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-09 16:44:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 244 transitions. [2020-12-09 16:44:52,227 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 244 transitions. Word has length 19 [2020-12-09 16:44:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:52,227 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 244 transitions. [2020-12-09 16:44:52,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:44:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2020-12-09 16:44:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 16:44:52,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:52,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:52,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 16:44:52,228 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 738709167, now seen corresponding path program 1 times [2020-12-09 16:44:52,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:52,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703053803] [2020-12-09 16:44:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:52,273 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-09 16:44:52,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703053803] [2020-12-09 16:44:52,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:52,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:44:52,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17357524] [2020-12-09 16:44:52,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:52,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:52,276 INFO L87 Difference]: Start difference. First operand 160 states and 244 transitions. Second operand 4 states. [2020-12-09 16:44:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:52,377 INFO L93 Difference]: Finished difference Result 583 states and 879 transitions. [2020-12-09 16:44:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:44:52,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-09 16:44:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:52,381 INFO L225 Difference]: With dead ends: 583 [2020-12-09 16:44:52,381 INFO L226 Difference]: Without dead ends: 425 [2020-12-09 16:44:52,383 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-09 16:44:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-12-09 16:44:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 377. [2020-12-09 16:44:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-12-09 16:44:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 558 transitions. [2020-12-09 16:44:52,408 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 558 transitions. Word has length 19 [2020-12-09 16:44:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:52,409 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 558 transitions. [2020-12-09 16:44:52,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 558 transitions. [2020-12-09 16:44:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 16:44:52,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:52,409 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] [2020-12-09 16:44:52,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 16:44:52,410 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1126985267, now seen corresponding path program 1 times [2020-12-09 16:44:52,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:52,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519617009] [2020-12-09 16:44:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:52,443 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-09 16:44:52,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519617009] [2020-12-09 16:44:52,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:52,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:44:52,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758772865] [2020-12-09 16:44:52,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:44:52,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:44:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:44:52,445 INFO L87 Difference]: Start difference. First operand 377 states and 558 transitions. Second operand 3 states. [2020-12-09 16:44:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:52,489 INFO L93 Difference]: Finished difference Result 871 states and 1287 transitions. [2020-12-09 16:44:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:44:52,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-09 16:44:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:52,492 INFO L225 Difference]: With dead ends: 871 [2020-12-09 16:44:52,492 INFO L226 Difference]: Without dead ends: 503 [2020-12-09 16:44:52,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:44:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-12-09 16:44:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 481. [2020-12-09 16:44:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-12-09 16:44:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 698 transitions. [2020-12-09 16:44:52,516 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 698 transitions. Word has length 20 [2020-12-09 16:44:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:52,516 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 698 transitions. [2020-12-09 16:44:52,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:44:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 698 transitions. [2020-12-09 16:44:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 16:44:52,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:52,517 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] [2020-12-09 16:44:52,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 16:44:52,517 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -161209262, now seen corresponding path program 1 times [2020-12-09 16:44:52,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:52,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136322150] [2020-12-09 16:44:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:52,560 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-09 16:44:52,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136322150] [2020-12-09 16:44:52,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:52,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:44:52,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621470394] [2020-12-09 16:44:52,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:52,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:52,562 INFO L87 Difference]: Start difference. First operand 481 states and 698 transitions. Second operand 4 states. [2020-12-09 16:44:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:52,644 INFO L93 Difference]: Finished difference Result 1839 states and 2707 transitions. [2020-12-09 16:44:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:44:52,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-09 16:44:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:52,651 INFO L225 Difference]: With dead ends: 1839 [2020-12-09 16:44:52,651 INFO L226 Difference]: Without dead ends: 1407 [2020-12-09 16:44:52,652 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-09 16:44:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-12-09 16:44:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 744. [2020-12-09 16:44:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-12-09 16:44:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1085 transitions. [2020-12-09 16:44:52,681 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1085 transitions. Word has length 20 [2020-12-09 16:44:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:52,682 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1085 transitions. [2020-12-09 16:44:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1085 transitions. [2020-12-09 16:44:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 16:44:52,683 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:52,683 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] [2020-12-09 16:44:52,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 16:44:52,683 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1460347596, now seen corresponding path program 1 times [2020-12-09 16:44:52,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:52,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913887565] [2020-12-09 16:44:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:52,745 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-09 16:44:52,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913887565] [2020-12-09 16:44:52,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:52,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:44:52,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895270840] [2020-12-09 16:44:52,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:44:52,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:44:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:44:52,747 INFO L87 Difference]: Start difference. First operand 744 states and 1085 transitions. Second operand 5 states. [2020-12-09 16:44:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:52,955 INFO L93 Difference]: Finished difference Result 3096 states and 4551 transitions. [2020-12-09 16:44:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:44:52,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-09 16:44:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:52,966 INFO L225 Difference]: With dead ends: 3096 [2020-12-09 16:44:52,966 INFO L226 Difference]: Without dead ends: 2407 [2020-12-09 16:44:52,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:44:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2020-12-09 16:44:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1336. [2020-12-09 16:44:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2020-12-09 16:44:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1945 transitions. [2020-12-09 16:44:53,028 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1945 transitions. Word has length 25 [2020-12-09 16:44:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:53,028 INFO L481 AbstractCegarLoop]: Abstraction has 1336 states and 1945 transitions. [2020-12-09 16:44:53,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:44:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1945 transitions. [2020-12-09 16:44:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 16:44:53,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:53,030 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] [2020-12-09 16:44:53,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 16:44:53,031 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -346603018, now seen corresponding path program 1 times [2020-12-09 16:44:53,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:53,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076738390] [2020-12-09 16:44:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:53,072 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-09 16:44:53,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076738390] [2020-12-09 16:44:53,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:53,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:44:53,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187669811] [2020-12-09 16:44:53,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:53,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:53,074 INFO L87 Difference]: Start difference. First operand 1336 states and 1945 transitions. Second operand 4 states. [2020-12-09 16:44:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:53,227 INFO L93 Difference]: Finished difference Result 4465 states and 6540 transitions. [2020-12-09 16:44:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:44:53,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-09 16:44:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:53,245 INFO L225 Difference]: With dead ends: 4465 [2020-12-09 16:44:53,245 INFO L226 Difference]: Without dead ends: 3140 [2020-12-09 16:44:53,248 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-09 16:44:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2020-12-09 16:44:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2397. [2020-12-09 16:44:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2020-12-09 16:44:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3460 transitions. [2020-12-09 16:44:53,383 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3460 transitions. Word has length 31 [2020-12-09 16:44:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:53,384 INFO L481 AbstractCegarLoop]: Abstraction has 2397 states and 3460 transitions. [2020-12-09 16:44:53,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3460 transitions. [2020-12-09 16:44:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 16:44:53,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:53,386 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-09 16:44:53,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 16:44:53,386 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash -411991937, now seen corresponding path program 1 times [2020-12-09 16:44:53,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:53,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779695884] [2020-12-09 16:44:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:53,433 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-09 16:44:53,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779695884] [2020-12-09 16:44:53,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:53,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:44:53,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892298545] [2020-12-09 16:44:53,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:44:53,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:53,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:44:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:44:53,435 INFO L87 Difference]: Start difference. First operand 2397 states and 3460 transitions. Second operand 6 states. [2020-12-09 16:44:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:53,781 INFO L93 Difference]: Finished difference Result 7121 states and 10335 transitions. [2020-12-09 16:44:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 16:44:53,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-12-09 16:44:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:53,809 INFO L225 Difference]: With dead ends: 7121 [2020-12-09 16:44:53,809 INFO L226 Difference]: Without dead ends: 4991 [2020-12-09 16:44:53,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:44:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2020-12-09 16:44:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 3142. [2020-12-09 16:44:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-12-09 16:44:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4535 transitions. [2020-12-09 16:44:53,969 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4535 transitions. Word has length 32 [2020-12-09 16:44:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:53,969 INFO L481 AbstractCegarLoop]: Abstraction has 3142 states and 4535 transitions. [2020-12-09 16:44:53,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:44:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4535 transitions. [2020-12-09 16:44:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 16:44:53,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:53,970 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:53,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 16:44:53,971 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1282024704, now seen corresponding path program 1 times [2020-12-09 16:44:53,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:53,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558913650] [2020-12-09 16:44:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:44:54,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558913650] [2020-12-09 16:44:54,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:54,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:44:54,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855611897] [2020-12-09 16:44:54,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:54,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:54,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:54,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:54,001 INFO L87 Difference]: Start difference. First operand 3142 states and 4535 transitions. Second operand 4 states. [2020-12-09 16:44:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:54,383 INFO L93 Difference]: Finished difference Result 11504 states and 16472 transitions. [2020-12-09 16:44:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:44:54,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-09 16:44:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:54,427 INFO L225 Difference]: With dead ends: 11504 [2020-12-09 16:44:54,428 INFO L226 Difference]: Without dead ends: 8373 [2020-12-09 16:44:54,433 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-09 16:44:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2020-12-09 16:44:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 6009. [2020-12-09 16:44:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2020-12-09 16:44:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 8545 transitions. [2020-12-09 16:44:54,749 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 8545 transitions. Word has length 34 [2020-12-09 16:44:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:54,749 INFO L481 AbstractCegarLoop]: Abstraction has 6009 states and 8545 transitions. [2020-12-09 16:44:54,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 8545 transitions. [2020-12-09 16:44:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 16:44:54,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:54,751 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-09 16:44:54,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 16:44:54,751 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1478427729, now seen corresponding path program 1 times [2020-12-09 16:44:54,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:54,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469787383] [2020-12-09 16:44:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:54,786 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-09 16:44:54,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469787383] [2020-12-09 16:44:54,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:54,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:44:54,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189063030] [2020-12-09 16:44:54,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:44:54,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:44:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:44:54,788 INFO L87 Difference]: Start difference. First operand 6009 states and 8545 transitions. Second operand 5 states. [2020-12-09 16:44:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:55,074 INFO L93 Difference]: Finished difference Result 13835 states and 19730 transitions. [2020-12-09 16:44:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:44:55,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-12-09 16:44:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:55,099 INFO L225 Difference]: With dead ends: 13835 [2020-12-09 16:44:55,099 INFO L226 Difference]: Without dead ends: 8337 [2020-12-09 16:44:55,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:44:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2020-12-09 16:44:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 8229. [2020-12-09 16:44:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2020-12-09 16:44:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 11677 transitions. [2020-12-09 16:44:55,366 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 11677 transitions. Word has length 35 [2020-12-09 16:44:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:55,366 INFO L481 AbstractCegarLoop]: Abstraction has 8229 states and 11677 transitions. [2020-12-09 16:44:55,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:44:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 11677 transitions. [2020-12-09 16:44:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 16:44:55,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:55,367 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:55,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 16:44:55,368 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1986127645, now seen corresponding path program 1 times [2020-12-09 16:44:55,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:55,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385876482] [2020-12-09 16:44:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:44:55,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385876482] [2020-12-09 16:44:55,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:55,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:44:55,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32475012] [2020-12-09 16:44:55,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:44:55,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:44:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:44:55,398 INFO L87 Difference]: Start difference. First operand 8229 states and 11677 transitions. Second operand 3 states. [2020-12-09 16:44:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:55,613 INFO L93 Difference]: Finished difference Result 16622 states and 23596 transitions. [2020-12-09 16:44:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:44:55,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-09 16:44:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:55,624 INFO L225 Difference]: With dead ends: 16622 [2020-12-09 16:44:55,624 INFO L226 Difference]: Without dead ends: 8404 [2020-12-09 16:44:55,630 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-09 16:44:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2020-12-09 16:44:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 8325. [2020-12-09 16:44:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8325 states. [2020-12-09 16:44:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 11811 transitions. [2020-12-09 16:44:55,839 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 11811 transitions. Word has length 36 [2020-12-09 16:44:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:55,839 INFO L481 AbstractCegarLoop]: Abstraction has 8325 states and 11811 transitions. [2020-12-09 16:44:55,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:44:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 11811 transitions. [2020-12-09 16:44:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 16:44:55,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:55,840 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:55,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 16:44:55,841 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 184026049, now seen corresponding path program 1 times [2020-12-09 16:44:55,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:55,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049027527] [2020-12-09 16:44:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:44:55,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049027527] [2020-12-09 16:44:55,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:55,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:44:55,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904236793] [2020-12-09 16:44:55,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:55,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:55,882 INFO L87 Difference]: Start difference. First operand 8325 states and 11811 transitions. Second operand 4 states. [2020-12-09 16:44:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:56,431 INFO L93 Difference]: Finished difference Result 28367 states and 40383 transitions. [2020-12-09 16:44:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:44:56,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 16:44:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:56,457 INFO L225 Difference]: With dead ends: 28367 [2020-12-09 16:44:56,457 INFO L226 Difference]: Without dead ends: 20053 [2020-12-09 16:44:56,465 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-09 16:44:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20053 states. [2020-12-09 16:44:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20053 to 15235. [2020-12-09 16:44:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15235 states. [2020-12-09 16:44:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15235 states to 15235 states and 21356 transitions. [2020-12-09 16:44:56,923 INFO L78 Accepts]: Start accepts. Automaton has 15235 states and 21356 transitions. Word has length 36 [2020-12-09 16:44:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:56,923 INFO L481 AbstractCegarLoop]: Abstraction has 15235 states and 21356 transitions. [2020-12-09 16:44:56,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15235 states and 21356 transitions. [2020-12-09 16:44:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 16:44:56,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:56,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:56,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 16:44:56,924 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1072052299, now seen corresponding path program 1 times [2020-12-09 16:44:56,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:56,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663344340] [2020-12-09 16:44:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:44:56,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663344340] [2020-12-09 16:44:56,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:56,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:44:56,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938523519] [2020-12-09 16:44:56,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:56,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:56,951 INFO L87 Difference]: Start difference. First operand 15235 states and 21356 transitions. Second operand 4 states. [2020-12-09 16:44:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:57,510 INFO L93 Difference]: Finished difference Result 34313 states and 48374 transitions. [2020-12-09 16:44:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:44:57,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 16:44:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:57,533 INFO L225 Difference]: With dead ends: 34313 [2020-12-09 16:44:57,534 INFO L226 Difference]: Without dead ends: 19685 [2020-12-09 16:44:57,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:44:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19685 states. [2020-12-09 16:44:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19685 to 16827. [2020-12-09 16:44:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16827 states. [2020-12-09 16:44:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16827 states to 16827 states and 23812 transitions. [2020-12-09 16:44:58,197 INFO L78 Accepts]: Start accepts. Automaton has 16827 states and 23812 transitions. Word has length 36 [2020-12-09 16:44:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:58,197 INFO L481 AbstractCegarLoop]: Abstraction has 16827 states and 23812 transitions. [2020-12-09 16:44:58,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16827 states and 23812 transitions. [2020-12-09 16:44:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 16:44:58,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:58,198 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:58,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 16:44:58,199 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash 393569696, now seen corresponding path program 1 times [2020-12-09 16:44:58,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:58,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782485050] [2020-12-09 16:44:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:44:58,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782485050] [2020-12-09 16:44:58,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:58,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:44:58,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277664161] [2020-12-09 16:44:58,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:58,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:58,223 INFO L87 Difference]: Start difference. First operand 16827 states and 23812 transitions. Second operand 4 states. [2020-12-09 16:44:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:44:58,769 INFO L93 Difference]: Finished difference Result 34945 states and 49525 transitions. [2020-12-09 16:44:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:44:58,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-12-09 16:44:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:44:58,787 INFO L225 Difference]: With dead ends: 34945 [2020-12-09 16:44:58,787 INFO L226 Difference]: Without dead ends: 18389 [2020-12-09 16:44:58,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:44:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18389 states. [2020-12-09 16:44:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18389 to 17259. [2020-12-09 16:44:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17259 states. [2020-12-09 16:44:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17259 states to 17259 states and 24332 transitions. [2020-12-09 16:44:59,316 INFO L78 Accepts]: Start accepts. Automaton has 17259 states and 24332 transitions. Word has length 37 [2020-12-09 16:44:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:44:59,316 INFO L481 AbstractCegarLoop]: Abstraction has 17259 states and 24332 transitions. [2020-12-09 16:44:59,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:44:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17259 states and 24332 transitions. [2020-12-09 16:44:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 16:44:59,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:44:59,317 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:44:59,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 16:44:59,317 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:44:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:44:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -637975326, now seen corresponding path program 1 times [2020-12-09 16:44:59,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:44:59,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609346409] [2020-12-09 16:44:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:44:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:44:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:44:59,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609346409] [2020-12-09 16:44:59,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:44:59,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:44:59,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160256282] [2020-12-09 16:44:59,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:44:59,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:44:59,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:44:59,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:44:59,340 INFO L87 Difference]: Start difference. First operand 17259 states and 24332 transitions. Second operand 4 states. [2020-12-09 16:45:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:00,078 INFO L93 Difference]: Finished difference Result 36431 states and 51374 transitions. [2020-12-09 16:45:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:45:00,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-09 16:45:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:00,098 INFO L225 Difference]: With dead ends: 36431 [2020-12-09 16:45:00,098 INFO L226 Difference]: Without dead ends: 19460 [2020-12-09 16:45:00,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:45:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19460 states. [2020-12-09 16:45:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19460 to 17701. [2020-12-09 16:45:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17701 states. [2020-12-09 16:45:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17701 states to 17701 states and 24886 transitions. [2020-12-09 16:45:00,726 INFO L78 Accepts]: Start accepts. Automaton has 17701 states and 24886 transitions. Word has length 38 [2020-12-09 16:45:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:00,727 INFO L481 AbstractCegarLoop]: Abstraction has 17701 states and 24886 transitions. [2020-12-09 16:45:00,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:45:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 17701 states and 24886 transitions. [2020-12-09 16:45:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 16:45:00,727 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:00,727 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-09 16:45:00,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 16:45:00,728 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1043016691, now seen corresponding path program 1 times [2020-12-09 16:45:00,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:00,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943861415] [2020-12-09 16:45:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:00,770 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-09 16:45:00,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943861415] [2020-12-09 16:45:00,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:45:00,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:45:00,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198685494] [2020-12-09 16:45:00,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:45:00,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:00,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:45:00,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:45:00,772 INFO L87 Difference]: Start difference. First operand 17701 states and 24886 transitions. Second operand 6 states. [2020-12-09 16:45:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:02,209 INFO L93 Difference]: Finished difference Result 63018 states and 89124 transitions. [2020-12-09 16:45:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 16:45:02,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-09 16:45:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:02,250 INFO L225 Difference]: With dead ends: 63018 [2020-12-09 16:45:02,250 INFO L226 Difference]: Without dead ends: 45967 [2020-12-09 16:45:02,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:45:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45967 states. [2020-12-09 16:45:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45967 to 27028. [2020-12-09 16:45:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27028 states. [2020-12-09 16:45:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27028 states to 27028 states and 38033 transitions. [2020-12-09 16:45:03,343 INFO L78 Accepts]: Start accepts. Automaton has 27028 states and 38033 transitions. Word has length 38 [2020-12-09 16:45:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:03,343 INFO L481 AbstractCegarLoop]: Abstraction has 27028 states and 38033 transitions. [2020-12-09 16:45:03,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:45:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27028 states and 38033 transitions. [2020-12-09 16:45:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 16:45:03,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:03,344 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:03,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 16:45:03,344 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1869098642, now seen corresponding path program 1 times [2020-12-09 16:45:03,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:03,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705055960] [2020-12-09 16:45:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:03,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705055960] [2020-12-09 16:45:03,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:45:03,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:45:03,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145736670] [2020-12-09 16:45:03,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:45:03,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:03,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:45:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:45:03,374 INFO L87 Difference]: Start difference. First operand 27028 states and 38033 transitions. Second operand 5 states. [2020-12-09 16:45:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:05,733 INFO L93 Difference]: Finished difference Result 89478 states and 125581 transitions. [2020-12-09 16:45:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 16:45:05,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-12-09 16:45:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:05,796 INFO L225 Difference]: With dead ends: 89478 [2020-12-09 16:45:05,796 INFO L226 Difference]: Without dead ends: 63452 [2020-12-09 16:45:05,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:45:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63452 states. [2020-12-09 16:45:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63452 to 31232. [2020-12-09 16:45:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31232 states. [2020-12-09 16:45:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31232 states to 31232 states and 43639 transitions. [2020-12-09 16:45:07,103 INFO L78 Accepts]: Start accepts. Automaton has 31232 states and 43639 transitions. Word has length 40 [2020-12-09 16:45:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:07,103 INFO L481 AbstractCegarLoop]: Abstraction has 31232 states and 43639 transitions. [2020-12-09 16:45:07,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:45:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31232 states and 43639 transitions. [2020-12-09 16:45:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 16:45:07,105 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:07,105 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:07,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 16:45:07,105 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 180750048, now seen corresponding path program 1 times [2020-12-09 16:45:07,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:07,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431888828] [2020-12-09 16:45:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:07,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431888828] [2020-12-09 16:45:07,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:45:07,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:45:07,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340721210] [2020-12-09 16:45:07,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:45:07,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:45:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:45:07,124 INFO L87 Difference]: Start difference. First operand 31232 states and 43639 transitions. Second operand 3 states. [2020-12-09 16:45:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:08,974 INFO L93 Difference]: Finished difference Result 70909 states and 99725 transitions. [2020-12-09 16:45:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:45:08,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-09 16:45:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:09,026 INFO L225 Difference]: With dead ends: 70909 [2020-12-09 16:45:09,027 INFO L226 Difference]: Without dead ends: 54035 [2020-12-09 16:45:09,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:45:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54035 states. [2020-12-09 16:45:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54035 to 53673. [2020-12-09 16:45:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53673 states. [2020-12-09 16:45:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53673 states to 53673 states and 75004 transitions. [2020-12-09 16:45:11,383 INFO L78 Accepts]: Start accepts. Automaton has 53673 states and 75004 transitions. Word has length 47 [2020-12-09 16:45:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:11,383 INFO L481 AbstractCegarLoop]: Abstraction has 53673 states and 75004 transitions. [2020-12-09 16:45:11,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:45:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 53673 states and 75004 transitions. [2020-12-09 16:45:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 16:45:11,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:11,385 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:11,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 16:45:11,385 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:11,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1658190920, now seen corresponding path program 1 times [2020-12-09 16:45:11,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:11,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853301948] [2020-12-09 16:45:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:45:11,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853301948] [2020-12-09 16:45:11,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:45:11,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:45:11,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049818007] [2020-12-09 16:45:11,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:45:11,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:45:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:45:11,406 INFO L87 Difference]: Start difference. First operand 53673 states and 75004 transitions. Second operand 3 states. [2020-12-09 16:45:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:15,046 INFO L93 Difference]: Finished difference Result 158039 states and 219526 transitions. [2020-12-09 16:45:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:45:15,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-09 16:45:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:15,150 INFO L225 Difference]: With dead ends: 158039 [2020-12-09 16:45:15,150 INFO L226 Difference]: Without dead ends: 104670 [2020-12-09 16:45:15,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:45:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104670 states. [2020-12-09 16:45:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104670 to 102872. [2020-12-09 16:45:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102872 states. [2020-12-09 16:45:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102872 states to 102872 states and 140075 transitions. [2020-12-09 16:45:19,454 INFO L78 Accepts]: Start accepts. Automaton has 102872 states and 140075 transitions. Word has length 52 [2020-12-09 16:45:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:19,455 INFO L481 AbstractCegarLoop]: Abstraction has 102872 states and 140075 transitions. [2020-12-09 16:45:19,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:45:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 102872 states and 140075 transitions. [2020-12-09 16:45:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 16:45:19,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:19,458 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:19,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 16:45:19,458 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1019406441, now seen corresponding path program 1 times [2020-12-09 16:45:19,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:19,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465678175] [2020-12-09 16:45:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:45:19,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465678175] [2020-12-09 16:45:19,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388718451] [2020-12-09 16:45:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:45:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:19,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:45:19,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:45:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:45:19,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:45:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:45:19,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:45:19,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2020-12-09 16:45:19,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564274202] [2020-12-09 16:45:19,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:45:19,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:45:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:45:19,628 INFO L87 Difference]: Start difference. First operand 102872 states and 140075 transitions. Second operand 3 states. [2020-12-09 16:45:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:25,326 INFO L93 Difference]: Finished difference Result 240736 states and 330649 transitions. [2020-12-09 16:45:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:45:25,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-09 16:45:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:25,492 INFO L225 Difference]: With dead ends: 240736 [2020-12-09 16:45:25,492 INFO L226 Difference]: Without dead ends: 156832 [2020-12-09 16:45:25,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:45:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156832 states. [2020-12-09 16:45:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156832 to 156824. [2020-12-09 16:45:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156824 states. [2020-12-09 16:45:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156824 states to 156824 states and 215053 transitions. [2020-12-09 16:45:32,143 INFO L78 Accepts]: Start accepts. Automaton has 156824 states and 215053 transitions. Word has length 52 [2020-12-09 16:45:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:32,143 INFO L481 AbstractCegarLoop]: Abstraction has 156824 states and 215053 transitions. [2020-12-09 16:45:32,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:45:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 156824 states and 215053 transitions. [2020-12-09 16:45:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 16:45:32,146 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:32,146 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:32,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:45:32,347 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -61221404, now seen corresponding path program 1 times [2020-12-09 16:45:32,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:32,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136245476] [2020-12-09 16:45:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:32,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136245476] [2020-12-09 16:45:32,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211997020] [2020-12-09 16:45:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:45:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:32,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:45:32,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:45:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:45:32,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:45:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:45:32,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:45:32,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [7] total 8 [2020-12-09 16:45:32,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807018644] [2020-12-09 16:45:32,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:45:32,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:45:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:45:32,584 INFO L87 Difference]: Start difference. First operand 156824 states and 215053 transitions. Second operand 3 states. [2020-12-09 16:45:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:45:43,796 INFO L93 Difference]: Finished difference Result 430535 states and 593341 transitions. [2020-12-09 16:45:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:45:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-09 16:45:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:45:44,125 INFO L225 Difference]: With dead ends: 430535 [2020-12-09 16:45:44,125 INFO L226 Difference]: Without dead ends: 273855 [2020-12-09 16:45:44,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:45:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273855 states. [2020-12-09 16:45:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273855 to 273847. [2020-12-09 16:45:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273847 states. [2020-12-09 16:45:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273847 states to 273847 states and 376607 transitions. [2020-12-09 16:45:56,081 INFO L78 Accepts]: Start accepts. Automaton has 273847 states and 376607 transitions. Word has length 54 [2020-12-09 16:45:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:45:56,082 INFO L481 AbstractCegarLoop]: Abstraction has 273847 states and 376607 transitions. [2020-12-09 16:45:56,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:45:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 273847 states and 376607 transitions. [2020-12-09 16:45:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 16:45:56,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:45:56,084 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:45:56,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:45:56,285 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:45:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:45:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash -174608061, now seen corresponding path program 1 times [2020-12-09 16:45:56,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:45:56,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935303133] [2020-12-09 16:45:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:45:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:56,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935303133] [2020-12-09 16:45:56,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562401173] [2020-12-09 16:45:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:45:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:45:56,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:45:56,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:45:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:56,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:45:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:45:56,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:45:56,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2020-12-09 16:45:56,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366651226] [2020-12-09 16:45:56,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:45:56,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:45:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:45:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:45:56,468 INFO L87 Difference]: Start difference. First operand 273847 states and 376607 transitions. Second operand 3 states. [2020-12-09 16:46:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:46:05,423 INFO L93 Difference]: Finished difference Result 471377 states and 650835 transitions. [2020-12-09 16:46:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:46:05,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-09 16:46:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:46:05,680 INFO L225 Difference]: With dead ends: 471377 [2020-12-09 16:46:05,680 INFO L226 Difference]: Without dead ends: 198209 [2020-12-09 16:46:05,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198209 states. [2020-12-09 16:46:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198209 to 196133. [2020-12-09 16:46:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196133 states. [2020-12-09 16:46:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196133 states to 196133 states and 266991 transitions. [2020-12-09 16:46:14,658 INFO L78 Accepts]: Start accepts. Automaton has 196133 states and 266991 transitions. Word has length 54 [2020-12-09 16:46:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:46:14,659 INFO L481 AbstractCegarLoop]: Abstraction has 196133 states and 266991 transitions. [2020-12-09 16:46:14,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:46:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 196133 states and 266991 transitions. [2020-12-09 16:46:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 16:46:14,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:46:14,661 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:46:14,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:46:14,862 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:46:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:46:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash 159510523, now seen corresponding path program 1 times [2020-12-09 16:46:14,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:46:14,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827107095] [2020-12-09 16:46:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:46:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:46:14,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827107095] [2020-12-09 16:46:14,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302665427] [2020-12-09 16:46:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:46:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:14,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:46:14,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:46:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:46:15,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:46:15,053 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 16:46:15,053 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:46:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:46:15,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:46:15,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 9 [2020-12-09 16:46:15,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250685838] [2020-12-09 16:46:15,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:46:15,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:46:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:46:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:15,086 INFO L87 Difference]: Start difference. First operand 196133 states and 266991 transitions. Second operand 6 states. [2020-12-09 16:46:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:46:25,420 INFO L93 Difference]: Finished difference Result 419713 states and 573337 transitions. [2020-12-09 16:46:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:46:25,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-12-09 16:46:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:46:25,734 INFO L225 Difference]: With dead ends: 419713 [2020-12-09 16:46:25,735 INFO L226 Difference]: Without dead ends: 225155 [2020-12-09 16:46:25,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225155 states. [2020-12-09 16:46:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225155 to 146807. [2020-12-09 16:46:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146807 states. [2020-12-09 16:46:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146807 states to 146807 states and 202517 transitions. [2020-12-09 16:46:33,429 INFO L78 Accepts]: Start accepts. Automaton has 146807 states and 202517 transitions. Word has length 54 [2020-12-09 16:46:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:46:33,430 INFO L481 AbstractCegarLoop]: Abstraction has 146807 states and 202517 transitions. [2020-12-09 16:46:33,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:46:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146807 states and 202517 transitions. [2020-12-09 16:46:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 16:46:33,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:46:33,436 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:46:33,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:46:33,638 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:46:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:46:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 189402078, now seen corresponding path program 1 times [2020-12-09 16:46:33,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:46:33,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663039674] [2020-12-09 16:46:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:46:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:46:33,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663039674] [2020-12-09 16:46:33,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598483072] [2020-12-09 16:46:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:46:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:33,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:46:33,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:46:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:46:33,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:46:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:46:33,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:46:33,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2020-12-09 16:46:33,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229658566] [2020-12-09 16:46:33,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:46:33,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:46:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:46:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:33,844 INFO L87 Difference]: Start difference. First operand 146807 states and 202517 transitions. Second operand 3 states. [2020-12-09 16:46:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:46:40,541 INFO L93 Difference]: Finished difference Result 262975 states and 364255 transitions. [2020-12-09 16:46:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:46:40,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-09 16:46:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:46:40,710 INFO L225 Difference]: With dead ends: 262975 [2020-12-09 16:46:40,711 INFO L226 Difference]: Without dead ends: 148489 [2020-12-09 16:46:40,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148489 states. [2020-12-09 16:46:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148489 to 146807. [2020-12-09 16:46:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146807 states. [2020-12-09 16:46:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146807 states to 146807 states and 198175 transitions. [2020-12-09 16:46:47,694 INFO L78 Accepts]: Start accepts. Automaton has 146807 states and 198175 transitions. Word has length 55 [2020-12-09 16:46:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:46:47,694 INFO L481 AbstractCegarLoop]: Abstraction has 146807 states and 198175 transitions. [2020-12-09 16:46:47,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:46:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 146807 states and 198175 transitions. [2020-12-09 16:46:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 16:46:47,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:46:47,696 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:46:47,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-09 16:46:47,898 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:46:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:46:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash -801762595, now seen corresponding path program 1 times [2020-12-09 16:46:47,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:46:47,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263337397] [2020-12-09 16:46:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:46:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:46:47,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263337397] [2020-12-09 16:46:47,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580411953] [2020-12-09 16:46:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:46:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:46:48,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:46:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:46:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:46:48,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:46:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:46:48,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:46:48,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [7] total 8 [2020-12-09 16:46:48,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935096195] [2020-12-09 16:46:48,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:46:48,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:46:48,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:46:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:48,082 INFO L87 Difference]: Start difference. First operand 146807 states and 198175 transitions. Second operand 3 states. [2020-12-09 16:46:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:46:54,853 INFO L93 Difference]: Finished difference Result 261301 states and 353481 transitions. [2020-12-09 16:46:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:46:54,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-09 16:46:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:46:55,205 INFO L225 Difference]: With dead ends: 261301 [2020-12-09 16:46:55,205 INFO L226 Difference]: Without dead ends: 146815 [2020-12-09 16:46:55,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:46:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146815 states. [2020-12-09 16:47:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146815 to 146807. [2020-12-09 16:47:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146807 states. [2020-12-09 16:47:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146807 states to 146807 states and 196697 transitions. [2020-12-09 16:47:02,247 INFO L78 Accepts]: Start accepts. Automaton has 146807 states and 196697 transitions. Word has length 55 [2020-12-09 16:47:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:47:02,247 INFO L481 AbstractCegarLoop]: Abstraction has 146807 states and 196697 transitions. [2020-12-09 16:47:02,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:47:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 146807 states and 196697 transitions. [2020-12-09 16:47:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 16:47:02,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:47:02,250 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:47:02,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:47:02,451 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:47:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:47:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash 329702887, now seen corresponding path program 1 times [2020-12-09 16:47:02,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:47:02,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349845041] [2020-12-09 16:47:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:47:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:47:02,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349845041] [2020-12-09 16:47:02,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:47:02,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 16:47:02,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712871196] [2020-12-09 16:47:02,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:47:02,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:47:02,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:47:02,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:47:02,498 INFO L87 Difference]: Start difference. First operand 146807 states and 196697 transitions. Second operand 6 states. [2020-12-09 16:47:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:47:10,072 INFO L93 Difference]: Finished difference Result 287887 states and 385672 transitions. [2020-12-09 16:47:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 16:47:10,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-12-09 16:47:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:47:10,245 INFO L225 Difference]: With dead ends: 287887 [2020-12-09 16:47:10,245 INFO L226 Difference]: Without dead ends: 141617 [2020-12-09 16:47:10,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-09 16:47:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141617 states. [2020-12-09 16:47:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141617 to 118813. [2020-12-09 16:47:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118813 states. [2020-12-09 16:47:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118813 states to 118813 states and 159770 transitions. [2020-12-09 16:47:16,460 INFO L78 Accepts]: Start accepts. Automaton has 118813 states and 159770 transitions. Word has length 55 [2020-12-09 16:47:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:47:16,460 INFO L481 AbstractCegarLoop]: Abstraction has 118813 states and 159770 transitions. [2020-12-09 16:47:16,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:47:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 118813 states and 159770 transitions. [2020-12-09 16:47:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 16:47:16,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:47:16,463 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:47:16,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-09 16:47:16,463 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:47:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:47:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -91020646, now seen corresponding path program 1 times [2020-12-09 16:47:16,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:47:16,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424433523] [2020-12-09 16:47:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:47:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:47:16,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424433523] [2020-12-09 16:47:16,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174829221] [2020-12-09 16:47:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:47:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:47:16,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:47:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:47:16,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:47:16,657 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 16:47:16,657 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:47:16,659 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 16:47:16,659 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:47:16,660 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 16:47:16,660 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:47:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:47:16,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:47:16,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [7] total 14 [2020-12-09 16:47:16,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378857852] [2020-12-09 16:47:16,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 16:47:16,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:47:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 16:47:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-12-09 16:47:16,680 INFO L87 Difference]: Start difference. First operand 118813 states and 159770 transitions. Second operand 8 states. [2020-12-09 16:47:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:47:27,731 INFO L93 Difference]: Finished difference Result 301782 states and 405715 transitions. [2020-12-09 16:47:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 16:47:27,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2020-12-09 16:47:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:47:27,953 INFO L225 Difference]: With dead ends: 301782 [2020-12-09 16:47:27,953 INFO L226 Difference]: Without dead ends: 182980 [2020-12-09 16:47:28,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:47:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182980 states. [2020-12-09 16:47:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182980 to 97402. [2020-12-09 16:47:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97402 states. [2020-12-09 16:47:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97402 states to 97402 states and 130492 transitions. [2020-12-09 16:47:34,085 INFO L78 Accepts]: Start accepts. Automaton has 97402 states and 130492 transitions. Word has length 56 [2020-12-09 16:47:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:47:34,085 INFO L481 AbstractCegarLoop]: Abstraction has 97402 states and 130492 transitions. [2020-12-09 16:47:34,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 16:47:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 97402 states and 130492 transitions. [2020-12-09 16:47:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 16:47:34,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:47:34,088 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:47:34,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-09 16:47:34,289 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:47:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:47:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -748902662, now seen corresponding path program 1 times [2020-12-09 16:47:34,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:47:34,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369665413] [2020-12-09 16:47:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:47:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:47:34,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369665413] [2020-12-09 16:47:34,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:47:34,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:47:34,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693592649] [2020-12-09 16:47:34,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:47:34,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:47:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:47:34,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:47:34,342 INFO L87 Difference]: Start difference. First operand 97402 states and 130492 transitions. Second operand 5 states. [2020-12-09 16:47:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:47:40,359 INFO L93 Difference]: Finished difference Result 196604 states and 262817 transitions. [2020-12-09 16:47:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:47:40,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2020-12-09 16:47:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:47:40,475 INFO L225 Difference]: With dead ends: 196604 [2020-12-09 16:47:40,475 INFO L226 Difference]: Without dead ends: 99268 [2020-12-09 16:47:40,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:47:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99268 states. [2020-12-09 16:47:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99268 to 80268. [2020-12-09 16:47:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80268 states. [2020-12-09 16:47:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80268 states to 80268 states and 106785 transitions. [2020-12-09 16:47:44,915 INFO L78 Accepts]: Start accepts. Automaton has 80268 states and 106785 transitions. Word has length 57 [2020-12-09 16:47:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:47:44,915 INFO L481 AbstractCegarLoop]: Abstraction has 80268 states and 106785 transitions. [2020-12-09 16:47:44,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:47:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 80268 states and 106785 transitions. [2020-12-09 16:47:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-09 16:47:44,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:47:44,919 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:47:44,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 16:47:44,920 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:47:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:47:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -46275325, now seen corresponding path program 1 times [2020-12-09 16:47:44,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:47:44,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279786057] [2020-12-09 16:47:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:47:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:47:44,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279786057] [2020-12-09 16:47:44,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:47:44,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:47:44,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864707677] [2020-12-09 16:47:44,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:47:44,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:47:44,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:47:44,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:47:44,941 INFO L87 Difference]: Start difference. First operand 80268 states and 106785 transitions. Second operand 3 states. [2020-12-09 16:47:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:47:49,836 INFO L93 Difference]: Finished difference Result 166514 states and 221198 transitions. [2020-12-09 16:47:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:47:49,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-09 16:47:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:47:49,925 INFO L225 Difference]: With dead ends: 166514 [2020-12-09 16:47:49,925 INFO L226 Difference]: Without dead ends: 86318 [2020-12-09 16:47:49,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:47:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86318 states. [2020-12-09 16:47:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86318 to 85841. [2020-12-09 16:47:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85841 states. [2020-12-09 16:47:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85841 states to 85841 states and 111105 transitions. [2020-12-09 16:47:54,610 INFO L78 Accepts]: Start accepts. Automaton has 85841 states and 111105 transitions. Word has length 66 [2020-12-09 16:47:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:47:54,610 INFO L481 AbstractCegarLoop]: Abstraction has 85841 states and 111105 transitions. [2020-12-09 16:47:54,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:47:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 85841 states and 111105 transitions. [2020-12-09 16:47:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-09 16:47:54,615 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:47:54,615 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:47:54,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 16:47:54,615 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:47:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:47:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1222879644, now seen corresponding path program 1 times [2020-12-09 16:47:54,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:47:54,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92159810] [2020-12-09 16:47:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:47:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:47:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:47:54,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92159810] [2020-12-09 16:47:54,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:47:54,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:47:54,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338623102] [2020-12-09 16:47:54,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:47:54,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:47:54,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:47:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:47:54,639 INFO L87 Difference]: Start difference. First operand 85841 states and 111105 transitions. Second operand 3 states. [2020-12-09 16:47:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:47:58,331 INFO L93 Difference]: Finished difference Result 157431 states and 204023 transitions. [2020-12-09 16:47:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:47:58,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-09 16:47:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:47:58,403 INFO L225 Difference]: With dead ends: 157431 [2020-12-09 16:47:58,403 INFO L226 Difference]: Without dead ends: 71662 [2020-12-09 16:47:58,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:47:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71662 states. [2020-12-09 16:48:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71662 to 71656. [2020-12-09 16:48:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71656 states. [2020-12-09 16:48:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71656 states to 71656 states and 92924 transitions. [2020-12-09 16:48:02,190 INFO L78 Accepts]: Start accepts. Automaton has 71656 states and 92924 transitions. Word has length 66 [2020-12-09 16:48:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:48:02,190 INFO L481 AbstractCegarLoop]: Abstraction has 71656 states and 92924 transitions. [2020-12-09 16:48:02,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:48:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71656 states and 92924 transitions. [2020-12-09 16:48:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-09 16:48:02,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:48:02,194 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:48:02,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 16:48:02,194 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:48:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:48:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1113327153, now seen corresponding path program 1 times [2020-12-09 16:48:02,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:48:02,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432944434] [2020-12-09 16:48:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:48:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:48:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:48:02,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432944434] [2020-12-09 16:48:02,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:48:02,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:48:02,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945355272] [2020-12-09 16:48:02,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:48:02,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:48:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:48:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:48:02,223 INFO L87 Difference]: Start difference. First operand 71656 states and 92924 transitions. Second operand 5 states. [2020-12-09 16:48:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:48:07,858 INFO L93 Difference]: Finished difference Result 172665 states and 222351 transitions. [2020-12-09 16:48:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:48:07,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2020-12-09 16:48:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:48:07,972 INFO L225 Difference]: With dead ends: 172665 [2020-12-09 16:48:07,972 INFO L226 Difference]: Without dead ends: 100847 [2020-12-09 16:48:08,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:48:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100847 states. [2020-12-09 16:48:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100847 to 82948. [2020-12-09 16:48:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82948 states. [2020-12-09 16:48:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82948 states to 82948 states and 106225 transitions. [2020-12-09 16:48:12,101 INFO L78 Accepts]: Start accepts. Automaton has 82948 states and 106225 transitions. Word has length 67 [2020-12-09 16:48:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:48:12,102 INFO L481 AbstractCegarLoop]: Abstraction has 82948 states and 106225 transitions. [2020-12-09 16:48:12,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:48:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 82948 states and 106225 transitions. [2020-12-09 16:48:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-09 16:48:12,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:48:12,108 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 16:48:12,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 16:48:12,108 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:48:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:48:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1164491642, now seen corresponding path program 1 times [2020-12-09 16:48:12,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:48:12,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269052831] [2020-12-09 16:48:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:48:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:48:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:48:12,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269052831] [2020-12-09 16:48:12,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:48:12,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:48:12,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235479843] [2020-12-09 16:48:12,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:48:12,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:48:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:48:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:48:12,138 INFO L87 Difference]: Start difference. First operand 82948 states and 106225 transitions. Second operand 5 states. [2020-12-09 16:48:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:48:20,301 INFO L93 Difference]: Finished difference Result 237396 states and 304134 transitions. [2020-12-09 16:48:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:48:20,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2020-12-09 16:48:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:48:20,473 INFO L225 Difference]: With dead ends: 237396 [2020-12-09 16:48:20,473 INFO L226 Difference]: Without dead ends: 156652 [2020-12-09 16:48:20,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:48:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156652 states. [2020-12-09 16:48:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156652 to 90184. [2020-12-09 16:48:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90184 states. [2020-12-09 16:48:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90184 states to 90184 states and 115001 transitions. [2020-12-09 16:48:25,559 INFO L78 Accepts]: Start accepts. Automaton has 90184 states and 115001 transitions. Word has length 76 [2020-12-09 16:48:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:48:25,559 INFO L481 AbstractCegarLoop]: Abstraction has 90184 states and 115001 transitions. [2020-12-09 16:48:25,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:48:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 90184 states and 115001 transitions. [2020-12-09 16:48:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-09 16:48:25,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:48:25,566 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:48:25,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-09 16:48:25,566 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:48:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:48:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1523145346, now seen corresponding path program 1 times [2020-12-09 16:48:25,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:48:25,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341068245] [2020-12-09 16:48:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:48:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:48:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:48:25,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341068245] [2020-12-09 16:48:25,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:48:25,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:48:25,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178375085] [2020-12-09 16:48:25,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:48:25,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:48:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:48:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:48:25,590 INFO L87 Difference]: Start difference. First operand 90184 states and 115001 transitions. Second operand 4 states. [2020-12-09 16:48:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:48:30,298 INFO L93 Difference]: Finished difference Result 170621 states and 217898 transitions. [2020-12-09 16:48:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:48:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-09 16:48:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:48:30,384 INFO L225 Difference]: With dead ends: 170621 [2020-12-09 16:48:30,384 INFO L226 Difference]: Without dead ends: 87340 [2020-12-09 16:48:30,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:48:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87340 states. [2020-12-09 16:48:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87340 to 83578. [2020-12-09 16:48:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83578 states. [2020-12-09 16:48:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83578 states to 83578 states and 106471 transitions. [2020-12-09 16:48:35,056 INFO L78 Accepts]: Start accepts. Automaton has 83578 states and 106471 transitions. Word has length 76 [2020-12-09 16:48:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:48:35,056 INFO L481 AbstractCegarLoop]: Abstraction has 83578 states and 106471 transitions. [2020-12-09 16:48:35,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:48:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 83578 states and 106471 transitions. [2020-12-09 16:48:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-09 16:48:35,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:48:35,063 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:48:35,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 16:48:35,063 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:48:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:48:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash -642939583, now seen corresponding path program 1 times [2020-12-09 16:48:35,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:48:35,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676082771] [2020-12-09 16:48:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:48:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 16:48:35,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 16:48:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 16:48:35,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 16:48:35,125 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 16:48:35,125 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 16:48:35,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-09 16:48:35,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:48:35 BoogieIcfgContainer [2020-12-09 16:48:35,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 16:48:35,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 16:48:35,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 16:48:35,219 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 16:48:35,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:44:51" (3/4) ... [2020-12-09 16:48:35,221 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 16:48:35,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e5b06d5f-9452-4baa-a1bc-a64157a4dc94/bin/utaipan/witness.graphml [2020-12-09 16:48:35,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 16:48:35,317 INFO L168 Benchmark]: Toolchain (without parser) took 224591.84 ms. Allocated memory was 121.6 MB in the beginning and 6.2 GB in the end (delta: 6.1 GB). Free memory was 77.3 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,317 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 121.6 MB. Free memory was 93.9 MB in the beginning and 93.8 MB in the end (delta: 117.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:48:35,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.48 ms. Allocated memory is still 121.6 MB. Free memory was 77.0 MB in the beginning and 95.5 MB in the end (delta: -18.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.62 ms. Allocated memory is still 121.6 MB. Free memory was 95.5 MB in the beginning and 92.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,318 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 121.6 MB. Free memory was 92.6 MB in the beginning and 90.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,318 INFO L168 Benchmark]: RCFGBuilder took 881.42 ms. Allocated memory was 121.6 MB in the beginning and 197.1 MB in the end (delta: 75.5 MB). Free memory was 90.2 MB in the beginning and 165.0 MB in the end (delta: -74.8 MB). Peak memory consumption was 74.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,319 INFO L168 Benchmark]: TraceAbstraction took 223278.49 ms. Allocated memory was 197.1 MB in the beginning and 6.2 GB in the end (delta: 6.0 GB). Free memory was 165.0 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,319 INFO L168 Benchmark]: Witness Printer took 97.52 ms. Allocated memory is still 6.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 16:48:35,320 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.12 ms. Allocated memory is still 121.6 MB. Free memory was 93.9 MB in the beginning and 93.8 MB in the end (delta: 117.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 266.48 ms. Allocated memory is still 121.6 MB. Free memory was 77.0 MB in the beginning and 95.5 MB in the end (delta: -18.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.62 ms. Allocated memory is still 121.6 MB. Free memory was 95.5 MB in the beginning and 92.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 121.6 MB. Free memory was 92.6 MB in the beginning and 90.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 881.42 ms. Allocated memory was 121.6 MB in the beginning and 197.1 MB in the end (delta: 75.5 MB). Free memory was 90.2 MB in the beginning and 165.0 MB in the end (delta: -74.8 MB). Peak memory consumption was 74.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 223278.49 ms. Allocated memory was 197.1 MB in the beginning and 6.2 GB in the end (delta: 6.0 GB). Free memory was 165.0 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.1 GB. * Witness Printer took 97.52 ms. Allocated memory is still 6.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 16.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int P_2_pc ; [L125] int P_2_st ; [L126] int P_2_i ; [L127] int P_2_ev ; [L192] int C_1_pc ; [L193] int C_1_st ; [L194] int C_1_i ; [L195] int C_1_ev ; [L196] int C_1_pr ; [L595] int count ; [L596] int __retres2 ; [L600] num = 0 [L601] i = 0 [L602] max_loop = 2 [L604] timer = 0 [L605] P_1_pc = 0 [L606] P_2_pc = 0 [L607] C_1_pc = 0 [L609] count = 0 [L587] P_1_i = 1 [L588] P_2_i = 1 [L589] C_1_i = 1 [L525] int kernel_st ; [L526] int tmp ; [L527] int tmp___0 ; [L531] kernel_st = 0 [L296] COND TRUE (int )P_1_i == 1 [L297] P_1_st = 0 [L301] COND TRUE (int )P_2_i == 1 [L302] P_2_st = 0 [L306] COND TRUE (int )C_1_i == 1 [L307] C_1_st = 0 [L461] int tmp ; [L462] int tmp___0 ; [L463] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L121] return (__retres1); [L467] tmp = is_P_1_triggered() [L469] COND FALSE !(\read(tmp)) [L174] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L177] COND FALSE !((int )P_2_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L187] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L189] return (__retres1); [L475] tmp___0 = is_P_2_triggered() [L477] COND FALSE !(\read(tmp___0)) [L256] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L259] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L269] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L279] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L281] return (__retres1); [L483] tmp___1 = is_C_1_triggered() [L485] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L539] COND TRUE 1 [L542] kernel_st = 1 [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; [L344] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L348] COND TRUE 1 [L316] int __retres1 ; [L319] COND TRUE (int )P_1_st == 0 [L320] __retres1 = 1 [L337] return (__retres1); [L351] tmp___2 = exists_runnable_thread() [L353] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L358] COND TRUE (int )P_1_st == 0 [L360] tmp = __VERIFIER_nondet_int() [L362] COND TRUE \read(tmp) [L364] P_1_st = 1 [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L85] COND TRUE i < max_loop [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L373] COND TRUE (int )P_2_st == 0 [L375] tmp___0 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp___0) [L379] P_2_st = 1 [L132] COND TRUE (int )P_2_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L143] COND TRUE i < max_loop [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L147] num += 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L149] COND FALSE !(\read(timer)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L159] P_2_pc = 1 [L160] P_2_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L388] COND TRUE (int )C_1_st == 0 [L390] tmp___1 = __VERIFIER_nondet_int() [L392] COND TRUE \read(tmp___1) [L394] C_1_st = 1 [L198] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L201] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L216] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L218] COND FALSE !(num == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L229] num -= 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L230] COND FALSE !(! (num >= 0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L25] char c ; [L26] char __retres3 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L29] COND FALSE !(i___0 == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L33] COND TRUE i___0 == 1 [L34] __retres3 = data_1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L44] return (__retres3); [L238] c = read_data(num) [L239] i += 1 [L240] C_1_pc = 2 [L241] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L348] COND TRUE 1 [L316] int __retres1 ; [L319] COND FALSE !((int )P_1_st == 0) [L323] COND FALSE !((int )P_2_st == 0) [L327] COND FALSE !((int )C_1_st == 0) [L335] __retres1 = 0 [L337] return (__retres1); [L351] tmp___2 = exists_runnable_thread() [L353] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L546] kernel_st = 2 [L550] kernel_st = 3 [L461] int tmp ; [L462] int tmp___0 ; [L463] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L121] return (__retres1); [L467] tmp = is_P_1_triggered() [L469] COND FALSE !(\read(tmp)) [L174] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L177] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L178] COND FALSE !((int )P_2_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L189] return (__retres1); [L475] tmp___0 = is_P_2_triggered() [L477] COND FALSE !(\read(tmp___0)) [L256] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L259] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L269] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L270] COND FALSE !((int )C_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L279] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L281] return (__retres1); [L483] tmp___1 = is_C_1_triggered() [L485] COND FALSE !(\read(tmp___1)) [L316] int __retres1 ; [L319] COND FALSE !((int )P_1_st == 0) [L323] COND FALSE !((int )P_2_st == 0) [L327] COND FALSE !((int )C_1_st == 0) [L335] __retres1 = 0 [L337] return (__retres1); [L556] tmp = exists_runnable_thread() [L558] COND TRUE tmp == 0 [L560] kernel_st = 4 [L430] C_1_ev = 1 [L431] P_1_ev = 1 [L432] P_2_ev = 1 [L461] int tmp ; [L462] int tmp___0 ; [L463] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L121] return (__retres1); [L467] tmp = is_P_1_triggered() [L469] COND TRUE \read(tmp) [L470] P_1_st = 0 [L174] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L177] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L178] COND TRUE (int )P_2_ev == 1 [L179] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L189] return (__retres1); [L475] tmp___0 = is_P_2_triggered() [L477] COND TRUE \read(tmp___0) [L478] P_2_st = 0 [L256] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L259] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L269] COND TRUE (int )C_1_pc == 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L270] COND TRUE (int )C_1_ev == 1 [L271] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L281] return (__retres1); [L483] tmp___1 = is_C_1_triggered() [L485] COND TRUE \read(tmp___1) [L486] C_1_st = 0 [L441] COND TRUE (int )P_1_ev == 1 [L442] P_1_ev = 2 [L446] COND TRUE (int )P_2_ev == 1 [L447] P_2_ev = 2 [L451] COND TRUE (int )C_1_ev == 1 [L452] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L506] int tmp ; [L507] int __retres2 ; [L316] int __retres1 ; [L319] COND TRUE (int )P_1_st == 0 [L320] __retres1 = 1 [L337] return (__retres1); [L511] tmp = exists_runnable_thread() [L513] COND TRUE \read(tmp) [L514] __retres2 = 0 [L521] return (__retres2); [L569] tmp___0 = stop_simulation() [L571] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L539] COND TRUE 1 [L542] kernel_st = 1 [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; [L344] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L348] COND TRUE 1 [L316] int __retres1 ; [L319] COND TRUE (int )P_1_st == 0 [L320] __retres1 = 1 [L337] return (__retres1); [L351] tmp___2 = exists_runnable_thread() [L353] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L358] COND TRUE (int )P_1_st == 0 [L360] tmp = __VERIFIER_nondet_int() [L362] COND TRUE \read(tmp) [L364] P_1_st = 1 [L74] COND FALSE !((int )P_1_pc == 0) [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L85] COND TRUE i < max_loop [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L373] COND TRUE (int )P_2_st == 0 [L375] tmp___0 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp___0) [L379] P_2_st = 1 [L132] COND FALSE !((int )P_2_pc == 0) [L135] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L143] COND TRUE i < max_loop [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L11] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 223.1s, OverallIterations: 33, TraceHistogramMax: 4, AutomataDifference: 119.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7240 SDtfs, 7577 SDslu, 11519 SDs, 0 SdLazy, 1846 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 811 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273847occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 100.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 368972 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1900 NumberOfCodeBlocks, 1900 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2152 ConstructedInterpolants, 0 QuantifiedInterpolants, 259729 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1921 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 46 InterpolantComputations, 39 PerfectInterpolantSequences, 415/422 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...