./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2.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_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 0f721563b23ef637d292551ef1a662f821e744b5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:01:36,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:01:36,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:01:36,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:01:36,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:01:36,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:01:36,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:01:36,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:01:36,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:01:36,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:01:36,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:01:36,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:01:36,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:01:36,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:01:36,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:01:36,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:01:36,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:01:36,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:01:36,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:01:36,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:01:36,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:01:36,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:01:36,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:01:36,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:01:36,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:01:36,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:01:36,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:01:36,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:01:36,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:01:36,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:01:36,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:01:36,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:01:36,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:01:36,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:01:36,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:01:37,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:01:37,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:01:37,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:01:37,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:01:37,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:01:37,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:01:37,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 08:01:37,020 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:01:37,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:01:37,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:01:37,021 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:01:37,021 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:01:37,022 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:01:37,022 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:01:37,022 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:01:37,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:01:37,022 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:01:37,023 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:01:37,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:01:37,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:01:37,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:01:37,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:01:37,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:01:37,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:01:37,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:01:37,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:01:37,025 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_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-12-09 08:01:37,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:01:37,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:01:37,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:01:37,210 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:01:37,211 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:01:37,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/../../sv-benchmarks/c/systemc/toy2.cil.c [2020-12-09 08:01:37,252 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/data/0749895ec/615bf1380da34bfaa70d9c7469279864/FLAG000e60127 [2020-12-09 08:01:37,625 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:01:37,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/sv-benchmarks/c/systemc/toy2.cil.c [2020-12-09 08:01:37,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/data/0749895ec/615bf1380da34bfaa70d9c7469279864/FLAG000e60127 [2020-12-09 08:01:37,643 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/data/0749895ec/615bf1380da34bfaa70d9c7469279864 [2020-12-09 08:01:37,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:01:37,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:01:37,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:01:37,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:01:37,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:01:37,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69524697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37, skipping insertion in model container [2020-12-09 08:01:37,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:01:37,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:01:37,784 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_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2020-12-09 08:01:37,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:01:37,833 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:01:37,841 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_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2020-12-09 08:01:37,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:01:37,879 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:01:37,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37 WrapperNode [2020-12-09 08:01:37,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:01:37,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:01:37,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:01:37,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:01:37,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:01:37,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:01:37,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:01:37,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:01:37,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... [2020-12-09 08:01:37,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:01:37,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:01:37,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:01:37,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:01:37,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:01:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:01:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:01:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:01:37,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:01:38,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:01:38,983 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-09 08:01:38,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:38 BoogieIcfgContainer [2020-12-09 08:01:38,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:01:38,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:01:38,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:01:38,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:01:38,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:01:37" (1/3) ... [2020-12-09 08:01:38,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267fe71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:01:38, skipping insertion in model container [2020-12-09 08:01:38,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:01:37" (2/3) ... [2020-12-09 08:01:38,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267fe71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:01:38, skipping insertion in model container [2020-12-09 08:01:38,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:38" (3/3) ... [2020-12-09 08:01:38,992 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-12-09 08:01:39,002 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:01:39,004 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:01:39,011 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:01:39,027 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:01:39,027 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:01:39,027 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:01:39,028 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:01:39,028 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:01:39,028 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:01:39,028 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:01:39,028 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:01:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-12-09 08:01:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 08:01:39,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:39,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:39,041 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash -274908721, now seen corresponding path program 1 times [2020-12-09 08:01:39,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:39,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210623270] [2020-12-09 08:01:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:39,196 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 08:01:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210623270] [2020-12-09 08:01:39,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:01:39,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:01:39,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276296235] [2020-12-09 08:01:39,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:01:39,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:01:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:01:39,215 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-12-09 08:01:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:39,263 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions. [2020-12-09 08:01:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:01:39,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-09 08:01:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:39,274 INFO L225 Difference]: With dead ends: 107 [2020-12-09 08:01:39,274 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 08:01:39,277 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 08:01:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 08:01:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2020-12-09 08:01:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 08:01:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2020-12-09 08:01:39,313 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 13 [2020-12-09 08:01:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:39,314 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2020-12-09 08:01:39,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:01:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2020-12-09 08:01:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 08:01:39,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:39,315 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:39,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:01:39,315 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1830279986, now seen corresponding path program 1 times [2020-12-09 08:01:39,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:39,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406562373] [2020-12-09 08:01:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:01:39,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406562373] [2020-12-09 08:01:39,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724396427] [2020-12-09 08:01:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:01:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:39,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:01:39,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:01:39,508 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 08:01:39,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:01:39,526 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 08:01:39,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:01:39,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2020-12-09 08:01:39,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461440920] [2020-12-09 08:01:39,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:01:39,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:01:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 08:01:39,529 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand 3 states. [2020-12-09 08:01:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:39,570 INFO L93 Difference]: Finished difference Result 126 states and 197 transitions. [2020-12-09 08:01:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:01:39,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-09 08:01:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:39,573 INFO L225 Difference]: With dead ends: 126 [2020-12-09 08:01:39,573 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 08:01:39,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 08:01:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 08:01:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2020-12-09 08:01:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 08:01:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2020-12-09 08:01:39,587 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 21 [2020-12-09 08:01:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:39,587 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2020-12-09 08:01:39,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:01:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2020-12-09 08:01:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 08:01:39,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:39,589 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:39,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 08:01:39,790 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash -657394703, now seen corresponding path program 1 times [2020-12-09 08:01:39,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:39,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250890362] [2020-12-09 08:01:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:01:39,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250890362] [2020-12-09 08:01:39,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233582973] [2020-12-09 08:01:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:01:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:40,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:01:40,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:01:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:01:40,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:01:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:01:40,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:01:40,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2020-12-09 08:01:40,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965789776] [2020-12-09 08:01:40,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:01:40,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:01:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:01:40,094 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand 4 states. [2020-12-09 08:01:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:40,126 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2020-12-09 08:01:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:01:40,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-09 08:01:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:40,128 INFO L225 Difference]: With dead ends: 181 [2020-12-09 08:01:40,128 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 08:01:40,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:01:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 08:01:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2020-12-09 08:01:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-09 08:01:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2020-12-09 08:01:40,139 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 31 [2020-12-09 08:01:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:40,139 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2020-12-09 08:01:40,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:01:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2020-12-09 08:01:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 08:01:40,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:40,140 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:40,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:01:40,342 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash 178294423, now seen corresponding path program 1 times [2020-12-09 08:01:40,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:40,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435627184] [2020-12-09 08:01:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:01:40,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435627184] [2020-12-09 08:01:40,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:01:40,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:01:40,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882652637] [2020-12-09 08:01:40,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:01:40,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:01:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:01:40,494 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand 3 states. [2020-12-09 08:01:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:40,537 INFO L93 Difference]: Finished difference Result 191 states and 301 transitions. [2020-12-09 08:01:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:01:40,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-09 08:01:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:40,538 INFO L225 Difference]: With dead ends: 191 [2020-12-09 08:01:40,538 INFO L226 Difference]: Without dead ends: 111 [2020-12-09 08:01:40,539 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 08:01:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-09 08:01:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2020-12-09 08:01:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 08:01:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 168 transitions. [2020-12-09 08:01:40,547 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 168 transitions. Word has length 39 [2020-12-09 08:01:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:40,548 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 168 transitions. [2020-12-09 08:01:40,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:01:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 168 transitions. [2020-12-09 08:01:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 08:01:40,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:40,549 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:40,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 08:01:40,549 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1957730856, now seen corresponding path program 1 times [2020-12-09 08:01:40,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:40,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816596337] [2020-12-09 08:01:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:01:40,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816596337] [2020-12-09 08:01:40,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:01:40,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:01:40,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887586569] [2020-12-09 08:01:40,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:01:40,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:01:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:01:40,588 INFO L87 Difference]: Start difference. First operand 110 states and 168 transitions. Second operand 4 states. [2020-12-09 08:01:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:40,634 INFO L93 Difference]: Finished difference Result 193 states and 296 transitions. [2020-12-09 08:01:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:01:40,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-09 08:01:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:40,636 INFO L225 Difference]: With dead ends: 193 [2020-12-09 08:01:40,636 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 08:01:40,637 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 08:01:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 08:01:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-12-09 08:01:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 08:01:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2020-12-09 08:01:40,647 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 39 [2020-12-09 08:01:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:40,647 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2020-12-09 08:01:40,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:01:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2020-12-09 08:01:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 08:01:40,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:40,649 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:01:40,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 08:01:40,650 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1376679784, now seen corresponding path program 1 times [2020-12-09 08:01:40,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:40,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961495719] [2020-12-09 08:01:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:01:40,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961495719] [2020-12-09 08:01:40,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:01:40,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:01:40,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656650304] [2020-12-09 08:01:40,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:01:40,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:01:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:01:40,700 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand 3 states. [2020-12-09 08:01:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:40,727 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2020-12-09 08:01:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:01:40,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-09 08:01:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:40,729 INFO L225 Difference]: With dead ends: 289 [2020-12-09 08:01:40,729 INFO L226 Difference]: Without dead ends: 183 [2020-12-09 08:01:40,730 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 08:01:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-09 08:01:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2020-12-09 08:01:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-12-09 08:01:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2020-12-09 08:01:40,744 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 40 [2020-12-09 08:01:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:40,745 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2020-12-09 08:01:40,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:01:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2020-12-09 08:01:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 08:01:40,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:40,747 INFO L422 BasicCegarLoop]: trace histogram [4, 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] [2020-12-09 08:01:40,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 08:01:40,748 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1507257437, now seen corresponding path program 1 times [2020-12-09 08:01:40,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:40,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59526022] [2020-12-09 08:01:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:01:41,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59526022] [2020-12-09 08:01:41,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877554485] [2020-12-09 08:01:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:01:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:41,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 08:01:41,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:01:41,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-09 08:01:41,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:01:41,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 1] term [2020-12-09 08:01:41,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:01:41,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 08:01:41,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:01:41,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:01:41,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:01:41,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:01:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:01:41,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:01:41,477 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,477 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,498 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-12-09 08:01:41,498 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,499 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,500 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,501 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 1] term [2020-12-09 08:01:41,501 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:01:41,502 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 1] term [2020-12-09 08:01:41,502 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:01:41,678 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:01:41,691 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:01:41,694 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,695 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,696 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,697 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,697 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,712 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 08:01:41,717 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,717 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,718 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,719 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,720 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,720 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,724 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,724 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,725 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,726 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,727 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,731 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,732 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,733 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,735 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,736 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,737 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,740 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,740 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,744 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 08:01:41,744 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,745 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 3, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 08:01:41,745 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,746 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 3, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 08:01:41,746 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,747 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,748 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,748 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 2, 1] term [2020-12-09 08:01:41,749 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,750 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 1] term [2020-12-09 08:01:41,750 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,752 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 08:01:41,752 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,753 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,753 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,754 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 3, 2, 3, 4, 3, 2, 3, 2, 3, 3, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 08:01:41,755 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,756 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 3, 4, 3, 2, 3, 2, 3, 3, 3, 3, 2, 3, 2, 2, 2, 1] term [2020-12-09 08:01:41,756 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,757 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 4, 3, 2, 3, 2, 3, 3, 3, 2, 2, 3, 2, 2, 2, 1] term [2020-12-09 08:01:41,758 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,759 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,759 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:01:41,760 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,760 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,760 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 3, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,761 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,761 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,762 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:01:41,762 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,763 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,763 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,763 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,764 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,765 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,766 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,766 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,766 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,769 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,769 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,771 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,771 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,774 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,775 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,775 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,776 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,776 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,777 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,777 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,779 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,779 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,780 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,780 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,781 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,781 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,782 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 08:01:41,782 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,783 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 2, 1] term [2020-12-09 08:01:41,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,783 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-12-09 08:01:41,784 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:01:41,785 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,785 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:01:41,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,787 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,788 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,788 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:01:41,789 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,790 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,790 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,791 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,792 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,792 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,793 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 3, 4, 2, 4, 2, 4, 2, 1] term [2020-12-09 08:01:41,793 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,794 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 3, 4, 2, 4, 2, 4, 2, 1] term [2020-12-09 08:01:41,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,794 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 4, 2, 4, 2, 1] term [2020-12-09 08:01:41,795 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:01:41,795 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,796 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,797 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,797 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,798 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 4, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,798 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,799 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,800 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,801 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,802 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 08:01:41,802 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,803 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 08:01:41,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,804 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 3, 2, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 3, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,804 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 3, 4, 3, 4, 3, 4, 2, 4, 2, 4, 3, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,806 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 08:01:41,806 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 2, 4, 2, 4, 2, 4, 2, 1] term [2020-12-09 08:01:41,807 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,808 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 4, 2, 4, 2, 4, 2, 1] term [2020-12-09 08:01:41,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,810 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 2, 3, 4, 2, 4, 2, 4, 3, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,811 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 4, 2, 4, 2, 4, 3, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,811 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:01:41,812 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,813 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 2, 4, 2, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,814 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 4, 2, 4, 3, 4, 2, 1] term [2020-12-09 08:01:41,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,814 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:41,815 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 4, 2, 4, 1] term [2020-12-09 08:01:41,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,094 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 42 [2020-12-09 08:01:42,246 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 2, 1] term [2020-12-09 08:01:42,246 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,246 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 1] term [2020-12-09 08:01:42,247 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,248 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 7, 3, 7, 3, 1] term [2020-12-09 08:01:42,248 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,250 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 7, 3, 7, 3, 1] term [2020-12-09 08:01:42,250 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,251 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 7, 3, 7, 3, 1] term [2020-12-09 08:01:42,251 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,252 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 2, 2, 2, 7, 3, 7, 3, 1] term [2020-12-09 08:01:42,252 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,253 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 2, 2, 2, 7, 3, 7, 3, 1] term [2020-12-09 08:01:42,253 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,255 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,255 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,256 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,256 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,257 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,258 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,259 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 08:01:42,260 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,260 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,261 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,262 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,263 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,264 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,265 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,266 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 08:01:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:01:42,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1194650729] [2020-12-09 08:01:42,343 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2020-12-09 08:01:42,343 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:01:42,346 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:01:42,350 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:01:42,351 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:01:42,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,627 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,637 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,647 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:42,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:43,937 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 208 [2020-12-09 08:01:45,047 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 213 [2020-12-09 08:01:45,283 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:01:45,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:01:45,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2020-12-09 08:01:45,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555983358] [2020-12-09 08:01:45,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 08:01:45,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:01:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 08:01:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2020-12-09 08:01:45,287 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand 29 states. [2020-12-09 08:01:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:01:47,576 INFO L93 Difference]: Finished difference Result 1742 states and 2576 transitions. [2020-12-09 08:01:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-12-09 08:01:47,576 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2020-12-09 08:01:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:01:47,583 INFO L225 Difference]: With dead ends: 1742 [2020-12-09 08:01:47,583 INFO L226 Difference]: Without dead ends: 1564 [2020-12-09 08:01:47,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=955, Invalid=2951, Unknown=0, NotChecked=0, Total=3906 [2020-12-09 08:01:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2020-12-09 08:01:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 397. [2020-12-09 08:01:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-12-09 08:01:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 605 transitions. [2020-12-09 08:01:47,622 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 605 transitions. Word has length 47 [2020-12-09 08:01:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:01:47,623 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 605 transitions. [2020-12-09 08:01:47,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 08:01:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 605 transitions. [2020-12-09 08:01:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 08:01:47,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:01:47,627 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 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] [2020-12-09 08:01:47,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:01:47,829 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:01:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:01:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash 955440571, now seen corresponding path program 1 times [2020-12-09 08:01:47,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:01:47,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705133974] [2020-12-09 08:01:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:01:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:01:47,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705133974] [2020-12-09 08:01:47,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943775164] [2020-12-09 08:01:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:01:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:01:48,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 08:01:48,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:01:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:01:48,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:01:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:01:48,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496151584] [2020-12-09 08:01:48,243 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2020-12-09 08:01:48,243 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:01:48,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:01:48,244 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:01:48,244 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:01:48,313 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,323 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,334 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,344 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,354 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:48,371 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:01:50,221 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:01:50,564 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:01:50,928 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:01:51,275 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:01:51,721 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:52,068 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:52,437 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:52,777 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:53,138 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:53,477 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:53,834 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:54,177 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:01:54,626 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:54,983 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:55,458 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:55,816 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:56,192 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:56,550 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:56,925 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:57,288 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:57,663 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:58,019 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:58,500 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:58,854 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:59,239 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:01:59,592 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:00,135 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-12-09 08:02:00,849 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:01,197 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:01,652 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:02,007 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:02,481 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:02,840 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:03,215 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:03,570 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:03,948 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:04,300 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:04,676 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:05,031 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:05,510 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:05,863 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:06,243 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:06,598 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-12-09 08:02:07,445 WARN L197 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2020-12-09 08:02:08,334 WARN L197 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 303 [2020-12-09 08:02:08,890 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:02:09,200 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:02:09,527 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:02:09,837 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:02:10,244 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:10,570 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:10,908 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:11,220 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:11,552 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:11,860 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:12,187 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:12,496 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:12,908 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:13,242 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:13,691 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:14,018 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:14,363 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:14,701 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:15,058 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:15,388 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:15,733 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:16,056 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:16,509 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:16,858 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:17,205 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:17,529 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:18,326 WARN L197 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2020-12-09 08:02:19,056 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:19,367 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:02:19,778 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:20,106 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:20,538 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:20,864 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:21,207 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:21,534 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:21,879 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:22,203 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:22,548 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:22,873 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:23,327 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:23,655 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:24,014 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:24,341 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:25,155 WARN L197 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2020-12-09 08:02:25,933 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 295 [2020-12-09 08:02:25,995 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:02:25,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:02:25,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 17 [2020-12-09 08:02:25,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145277933] [2020-12-09 08:02:25,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 08:02:25,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:02:25,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 08:02:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-12-09 08:02:25,996 INFO L87 Difference]: Start difference. First operand 397 states and 605 transitions. Second operand 17 states. [2020-12-09 08:02:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:02:26,563 INFO L93 Difference]: Finished difference Result 1060 states and 1605 transitions. [2020-12-09 08:02:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 08:02:26,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2020-12-09 08:02:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:02:26,566 INFO L225 Difference]: With dead ends: 1060 [2020-12-09 08:02:26,566 INFO L226 Difference]: Without dead ends: 564 [2020-12-09 08:02:26,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 08:02:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-12-09 08:02:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 345. [2020-12-09 08:02:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-12-09 08:02:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 471 transitions. [2020-12-09 08:02:26,585 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 471 transitions. Word has length 55 [2020-12-09 08:02:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:02:26,585 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 471 transitions. [2020-12-09 08:02:26,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 08:02:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2020-12-09 08:02:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 08:02:26,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:02:26,587 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 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] [2020-12-09 08:02:26,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:02:26,788 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:02:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:02:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash -840094899, now seen corresponding path program 1 times [2020-12-09 08:02:26,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:02:26,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979239800] [2020-12-09 08:02:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:02:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:02:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:02:27,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979239800] [2020-12-09 08:02:27,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728832992] [2020-12-09 08:02:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:02:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:02:27,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 08:02:27,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:02:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 08:02:27,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:02:28,563 WARN L197 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 95 [2020-12-09 08:02:30,678 WARN L197 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 223 DAG size of output: 155 [2020-12-09 08:02:31,791 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 134 [2020-12-09 08:02:32,463 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 45 [2020-12-09 08:02:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:02:32,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592071474] [2020-12-09 08:02:32,632 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2020-12-09 08:02:32,632 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:02:32,633 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:02:32,633 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:02:32,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:02:32,727 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,765 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,774 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,783 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,792 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:32,800 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:34,430 WARN L197 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 388 DAG size of output: 377 [2020-12-09 08:02:37,452 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 579 DAG size of output: 542 [2020-12-09 08:02:41,234 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 614 DAG size of output: 572 [2020-12-09 08:02:42,470 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 179 [2020-12-09 08:02:42,655 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2020-12-09 08:02:43,050 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 299 [2020-12-09 08:02:45,425 WARN L197 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 617 DAG size of output: 580 [2020-12-09 08:02:46,194 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:02:46,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:02:46,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 29 [2020-12-09 08:02:46,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472655302] [2020-12-09 08:02:46,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-09 08:02:46,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:02:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-09 08:02:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2020-12-09 08:02:46,196 INFO L87 Difference]: Start difference. First operand 345 states and 471 transitions. Second operand 30 states. [2020-12-09 08:02:46,436 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2020-12-09 08:02:46,696 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2020-12-09 08:02:47,056 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-12-09 08:02:47,760 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 41 [2020-12-09 08:02:48,124 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 45 [2020-12-09 08:02:48,765 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 39 [2020-12-09 08:02:48,978 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 28 [2020-12-09 08:02:49,206 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 41 [2020-12-09 08:02:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:02:49,508 INFO L93 Difference]: Finished difference Result 1537 states and 2063 transitions. [2020-12-09 08:02:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-09 08:02:49,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2020-12-09 08:02:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:02:49,514 INFO L225 Difference]: With dead ends: 1537 [2020-12-09 08:02:49,514 INFO L226 Difference]: Without dead ends: 1217 [2020-12-09 08:02:49,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 08:02:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-12-09 08:02:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 344. [2020-12-09 08:02:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-12-09 08:02:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 477 transitions. [2020-12-09 08:02:49,543 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 477 transitions. Word has length 59 [2020-12-09 08:02:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:02:49,543 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 477 transitions. [2020-12-09 08:02:49,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-09 08:02:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 477 transitions. [2020-12-09 08:02:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-09 08:02:49,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:02:49,544 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 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] [2020-12-09 08:02:49,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1126 [2020-12-09 08:02:49,746 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:02:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:02:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1118793517, now seen corresponding path program 1 times [2020-12-09 08:02:49,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:02:49,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689345692] [2020-12-09 08:02:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:02:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:02:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 08:02:49,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689345692] [2020-12-09 08:02:49,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:02:49,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:02:49,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348495622] [2020-12-09 08:02:49,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:02:49,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:02:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:02:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:02:49,793 INFO L87 Difference]: Start difference. First operand 344 states and 477 transitions. Second operand 3 states. [2020-12-09 08:02:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:02:49,830 INFO L93 Difference]: Finished difference Result 673 states and 935 transitions. [2020-12-09 08:02:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:02:49,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-09 08:02:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:02:49,832 INFO L225 Difference]: With dead ends: 673 [2020-12-09 08:02:49,832 INFO L226 Difference]: Without dead ends: 342 [2020-12-09 08:02:49,833 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 08:02:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-12-09 08:02:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 332. [2020-12-09 08:02:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-12-09 08:02:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2020-12-09 08:02:49,854 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 444 transitions. Word has length 64 [2020-12-09 08:02:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:02:49,854 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 444 transitions. [2020-12-09 08:02:49,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:02:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 444 transitions. [2020-12-09 08:02:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-09 08:02:49,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:02:49,855 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 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] [2020-12-09 08:02:49,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2785 [2020-12-09 08:02:49,855 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:02:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:02:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1224351718, now seen corresponding path program 1 times [2020-12-09 08:02:49,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:02:49,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121932458] [2020-12-09 08:02:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:02:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:02:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 08:02:49,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121932458] [2020-12-09 08:02:49,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702071638] [2020-12-09 08:02:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:02:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:02:49,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 08:02:49,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:02:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:02:50,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:02:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 08:02:50,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021280159] [2020-12-09 08:02:50,284 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2020-12-09 08:02:50,284 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:02:50,284 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:02:50,284 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:02:50,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:02:52,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,557 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,565 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:52,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:02:54,219 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 287 [2020-12-09 08:02:54,836 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2020-12-09 08:02:55,274 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:55,614 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:55,972 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:56,307 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:02:56,745 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:57,102 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:57,500 WARN L197 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:57,842 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:02:58,212 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2020-12-09 08:03:01,574 WARN L197 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 623 DAG size of output: 564 [2020-12-09 08:03:02,217 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:02,523 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:02,845 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:03,148 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:03,543 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:03,848 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:04,177 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:04,486 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:04,815 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:03:07,879 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 590 DAG size of output: 547 [2020-12-09 08:03:08,024 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:03:08,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:03:08,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2020-12-09 08:03:08,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798632943] [2020-12-09 08:03:08,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 08:03:08,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:03:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 08:03:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-12-09 08:03:08,026 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. Second operand 22 states. [2020-12-09 08:03:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:03:08,387 INFO L93 Difference]: Finished difference Result 866 states and 1147 transitions. [2020-12-09 08:03:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 08:03:08,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2020-12-09 08:03:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:03:08,389 INFO L225 Difference]: With dead ends: 866 [2020-12-09 08:03:08,389 INFO L226 Difference]: Without dead ends: 547 [2020-12-09 08:03:08,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2020-12-09 08:03:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-12-09 08:03:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 386. [2020-12-09 08:03:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-12-09 08:03:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 482 transitions. [2020-12-09 08:03:08,420 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 482 transitions. Word has length 66 [2020-12-09 08:03:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:03:08,420 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 482 transitions. [2020-12-09 08:03:08,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 08:03:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 482 transitions. [2020-12-09 08:03:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-09 08:03:08,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:03:08,421 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 08:03:08,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2786,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:03:08,623 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:03:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:03:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1749901475, now seen corresponding path program 1 times [2020-12-09 08:03:08,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:03:08,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792088648] [2020-12-09 08:03:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:03:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:03:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 08:03:08,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792088648] [2020-12-09 08:03:08,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530598210] [2020-12-09 08:03:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/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 08:03:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:03:08,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 08:03:08,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:03:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:03:08,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:03:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:03:09,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103027225] [2020-12-09 08:03:09,319 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2020-12-09 08:03:09,319 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:03:09,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:03:09,319 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:03:09,319 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:03:11,514 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,523 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,532 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,575 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:11,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:13,580 WARN L197 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 360 [2020-12-09 08:03:14,219 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2020-12-09 08:03:14,710 WARN L197 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:03:15,045 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:03:15,411 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:03:15,766 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-12-09 08:03:16,196 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:03:16,545 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:03:16,904 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:03:17,239 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-12-09 08:03:17,662 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-12-09 08:03:21,236 WARN L197 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 614 DAG size of output: 568 [2020-12-09 08:03:21,884 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:22,192 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:22,512 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:22,815 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:23,231 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:23,535 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:23,866 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:24,171 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:24,515 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-12-09 08:03:27,397 WARN L197 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 558 DAG size of output: 528 [2020-12-09 08:03:27,549 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:03:27,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:03:27,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 27 [2020-12-09 08:03:27,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465022808] [2020-12-09 08:03:27,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 08:03:27,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:03:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 08:03:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2020-12-09 08:03:27,550 INFO L87 Difference]: Start difference. First operand 386 states and 482 transitions. Second operand 27 states. [2020-12-09 08:03:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:03:28,138 INFO L93 Difference]: Finished difference Result 827 states and 1030 transitions. [2020-12-09 08:03:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 08:03:28,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2020-12-09 08:03:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:03:28,140 INFO L225 Difference]: With dead ends: 827 [2020-12-09 08:03:28,140 INFO L226 Difference]: Without dead ends: 460 [2020-12-09 08:03:28,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 08:03:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-12-09 08:03:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 429. [2020-12-09 08:03:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-12-09 08:03:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 508 transitions. [2020-12-09 08:03:28,179 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 508 transitions. Word has length 68 [2020-12-09 08:03:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:03:28,179 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 508 transitions. [2020-12-09 08:03:28,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 08:03:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 508 transitions. [2020-12-09 08:03:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-09 08:03:28,180 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:03:28,180 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 08:03:28,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3200,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:03:28,381 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:03:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:03:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1334833788, now seen corresponding path program 1 times [2020-12-09 08:03:28,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:03:28,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523955907] [2020-12-09 08:03:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:03:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:03:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:03:28,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523955907] [2020-12-09 08:03:28,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880894756] [2020-12-09 08:03:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:03:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:03:28,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 08:03:28,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:03:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:03:28,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:03:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:03:29,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624315129] [2020-12-09 08:03:29,379 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2020-12-09 08:03:29,380 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:03:29,380 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:03:29,380 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:03:29,380 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:03:31,529 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,555 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,571 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:31,593 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:03:33,239 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 575 DAG size of output: 544 [2020-12-09 08:03:35,496 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 578 DAG size of output: 520 [2020-12-09 08:03:36,116 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2020-12-09 08:03:36,516 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:36,831 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:37,142 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:37,435 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-12-09 08:03:37,816 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:38,113 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:38,450 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:38,745 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 08:03:39,080 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-12-09 08:03:40,468 WARN L197 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 298 [2020-12-09 08:03:41,039 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-12-09 08:03:41,330 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-12-09 08:03:41,668 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-12-09 08:03:41,969 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-12-09 08:03:42,341 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-09 08:03:42,632 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-09 08:03:42,940 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-09 08:03:43,255 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-09 08:03:43,565 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-12-09 08:03:46,120 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 503 DAG size of output: 487 [2020-12-09 08:03:46,262 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:03:46,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:03:46,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 35 [2020-12-09 08:03:46,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932624369] [2020-12-09 08:03:46,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-09 08:03:46,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:03:46,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-09 08:03:46,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 08:03:46,263 INFO L87 Difference]: Start difference. First operand 429 states and 508 transitions. Second operand 36 states. [2020-12-09 08:03:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:03:49,237 INFO L93 Difference]: Finished difference Result 1417 states and 1670 transitions. [2020-12-09 08:03:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-09 08:03:49,238 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2020-12-09 08:03:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:03:49,241 INFO L225 Difference]: With dead ends: 1417 [2020-12-09 08:03:49,241 INFO L226 Difference]: Without dead ends: 822 [2020-12-09 08:03:49,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1543, Invalid=5939, Unknown=0, NotChecked=0, Total=7482 [2020-12-09 08:03:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-12-09 08:03:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 385. [2020-12-09 08:03:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-12-09 08:03:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 453 transitions. [2020-12-09 08:03:49,286 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 453 transitions. Word has length 70 [2020-12-09 08:03:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:03:49,286 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 453 transitions. [2020-12-09 08:03:49,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-09 08:03:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 453 transitions. [2020-12-09 08:03:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 08:03:49,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:03:49,287 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 08:03:49,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3596,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:03:49,488 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:03:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:03:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1549014365, now seen corresponding path program 1 times [2020-12-09 08:03:49,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:03:49,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350278961] [2020-12-09 08:03:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:03:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:03:49,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:03:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:03:49,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:03:49,562 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 08:03:49,562 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 08:03:49,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4171 [2020-12-09 08:03:49,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:03:49 BoogieIcfgContainer [2020-12-09 08:03:49,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 08:03:49,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 08:03:49,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 08:03:49,669 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 08:03:49,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:01:38" (3/4) ... [2020-12-09 08:03:49,671 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 08:03:49,780 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_70aaaf0c-d56d-4d7b-83bc-f7b92e0ebf49/bin/utaipan/witness.graphml [2020-12-09 08:03:49,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 08:03:49,781 INFO L168 Benchmark]: Toolchain (without parser) took 132134.97 ms. Allocated memory was 109.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 84.0 MB in the beginning and 866.2 MB in the end (delta: -782.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,781 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 109.1 MB. Free memory is still 74.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:03:49,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.63 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 82.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 109.1 MB. Free memory was 82.1 MB in the beginning and 79.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,782 INFO L168 Benchmark]: Boogie Preprocessor took 24.76 ms. Allocated memory is still 109.1 MB. Free memory was 79.8 MB in the beginning and 77.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,783 INFO L168 Benchmark]: RCFGBuilder took 1047.65 ms. Allocated memory was 109.1 MB in the beginning and 142.6 MB in the end (delta: 33.6 MB). Free memory was 77.7 MB in the beginning and 95.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,783 INFO L168 Benchmark]: TraceAbstraction took 130681.94 ms. Allocated memory was 142.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 95.5 MB in the beginning and 885.1 MB in the end (delta: -789.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,783 INFO L168 Benchmark]: Witness Printer took 111.40 ms. Allocated memory is still 1.9 GB. Free memory was 885.1 MB in the beginning and 866.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 08:03:49,785 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 109.1 MB. Free memory is still 74.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 232.63 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 82.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 109.1 MB. Free memory was 82.1 MB in the beginning and 79.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.76 ms. Allocated memory is still 109.1 MB. Free memory was 79.8 MB in the beginning and 77.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1047.65 ms. Allocated memory was 109.1 MB in the beginning and 142.6 MB in the end (delta: 33.6 MB). Free memory was 77.7 MB in the beginning and 95.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 130681.94 ms. Allocated memory was 142.6 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 95.5 MB in the beginning and 885.1 MB in the end (delta: -789.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. * Witness Printer took 111.40 ms. Allocated memory is still 1.9 GB. Free memory was 885.1 MB in the beginning and 866.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 [L396] COND FALSE !((int )c_req_up == 1) [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 [L432] COND FALSE !((int )e_f == 0) [L437] COND FALSE !((int )e_g == 0) [L442] COND FALSE !((int )e_e == 0) [L447] COND FALSE !((int )e_c == 0) [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) [L484] COND FALSE !((int )c2_pc == 1) [L493] COND FALSE !((int )wb_pc == 1) [L502] COND FALSE !((int )e_c == 1) [L507] COND FALSE !((int )e_e == 1) [L512] COND FALSE !((int )e_f == 1) [L517] COND FALSE !((int )e_g == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 [L129] COND TRUE (int )c1_pc == 0 [L140] COND TRUE 1 [L142] c1_st = 2 [L143] c1_pc = 1 [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 [L174] COND TRUE (int )c2_pc == 0 [L185] COND TRUE 1 [L187] c2_st = 2 [L188] c2_pc = 1 [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 [L219] COND TRUE (int )wb_pc == 0 [L230] COND TRUE 1 [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 [L540] COND FALSE !((int )c_req_up == 1) [L551] kernel_st = 3 [L552] COND FALSE !((int )e_f == 0) [L557] COND FALSE !((int )e_g == 0) [L562] COND FALSE !((int )e_e == 0) [L567] COND FALSE !((int )e_c == 0) [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 [L596] COND FALSE !((int )e_f == 1) [L604] COND TRUE (int )c2_pc == 1 [L605] COND FALSE !((int )e_f == 1) [L613] COND TRUE (int )wb_pc == 1 [L614] COND FALSE !((int )e_g == 1) [L622] COND FALSE !((int )e_c == 1) [L627] COND FALSE !((int )e_e == 1) [L632] COND FALSE !((int )e_f == 1) [L637] COND FALSE !((int )e_g == 1) [L642] COND FALSE !((int )e_c == 1) [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 [L85] COND TRUE (int )c1_pc == 1 [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 [L94] COND TRUE (int )c2_pc == 1 [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 [L129] COND FALSE !((int )c1_pc == 0) [L132] COND TRUE (int )c1_pc == 1 [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 [L150] COND TRUE (int )wb_pc == 1 [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 [L159] e_g = 2 [L140] COND TRUE 1 [L142] c1_st = 2 [L143] c1_pc = 1 [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 [L174] COND FALSE !((int )c2_pc == 0) [L177] COND TRUE (int )c2_pc == 1 [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 [L195] COND TRUE (int )wb_pc == 1 [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 [L204] e_g = 2 [L185] COND TRUE 1 [L187] c2_st = 2 [L188] c2_pc = 1 [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 [L219] COND FALSE !((int )wb_pc == 0) [L222] COND TRUE (int )wb_pc == 1 [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 [L230] COND TRUE 1 [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 [L540] COND TRUE (int )c_req_up == 1 [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 [L547] c_req_up = 0 [L551] kernel_st = 3 [L552] COND FALSE !((int )e_f == 0) [L557] COND FALSE !((int )e_g == 0) [L562] COND FALSE !((int )e_e == 0) [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 [L596] COND FALSE !((int )e_f == 1) [L604] COND TRUE (int )c2_pc == 1 [L605] COND FALSE !((int )e_f == 1) [L613] COND TRUE (int )wb_pc == 1 [L614] COND FALSE !((int )e_g == 1) [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 [L627] COND FALSE !((int )e_e == 1) [L632] COND FALSE !((int )e_f == 1) [L637] COND FALSE !((int )e_g == 1) [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) [L339] COND FALSE !((int )c2_st == 0) [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 130.5s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 947 SDtfs, 5961 SDslu, 6813 SDs, 0 SdLazy, 4213 SolverSat, 959 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1081 GetRequests, 746 SyntacticMatches, 17 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5083 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 2934 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 1549224 SizeOfPredicates, 170 NumberOfNonLiveVariables, 1858 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 766/1176 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...