./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.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_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 f6768ec4cb10c0d030986cdc2e459713dbcdaadd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:41:18,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:41:18,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:41:18,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:41:18,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:41:18,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:41:18,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:41:18,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:41:18,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:41:18,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:41:18,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:41:18,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:41:18,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:41:18,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:41:18,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:41:18,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:41:18,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:41:18,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:41:18,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:41:18,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:41:18,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:41:18,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:41:18,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:41:18,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:41:18,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:41:18,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:41:18,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:41:18,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:41:18,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:41:18,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:41:18,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:41:18,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:41:19,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:41:19,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:41:19,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:41:19,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:41:19,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:41:19,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:41:19,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:41:19,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:41:19,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:41:19,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:41:19,022 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:41:19,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:41:19,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:41:19,023 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:41:19,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:41:19,023 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:41:19,024 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:41:19,024 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:41:19,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:41:19,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:41:19,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:41:19,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:41:19,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:41:19,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:41:19,027 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_c7bffe2b-0849-4781-840f-953f9bc6102a/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_c7bffe2b-0849-4781-840f-953f9bc6102a/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 -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2020-12-09 18:41:19,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:41:19,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:41:19,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:41:19,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:41:19,232 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:41:19,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-12-09 18:41:19,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/data/4116b9b56/f7f1e17e1b974f208a9af7d31d44551e/FLAG4a1bf4841 [2020-12-09 18:41:19,648 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:41:19,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-12-09 18:41:19,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/data/4116b9b56/f7f1e17e1b974f208a9af7d31d44551e/FLAG4a1bf4841 [2020-12-09 18:41:19,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/data/4116b9b56/f7f1e17e1b974f208a9af7d31d44551e [2020-12-09 18:41:19,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:41:19,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:41:19,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:41:19,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:41:19,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:41:19,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36aa0002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19, skipping insertion in model container [2020-12-09 18:41:19,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:41:19,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:41:19,801 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_c7bffe2b-0849-4781-840f-953f9bc6102a/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] [2020-12-09 18:41:19,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:41:19,847 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:41:19,855 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_c7bffe2b-0849-4781-840f-953f9bc6102a/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] [2020-12-09 18:41:19,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:41:19,892 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:41:19,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19 WrapperNode [2020-12-09 18:41:19,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:41:19,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:41:19,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:41:19,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:41:19,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:41:19,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:41:19,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:41:19,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:41:19,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... [2020-12-09 18:41:19,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:41:19,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:41:19,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:41:19,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:41:19,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:41:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 18:41:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:41:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:41:21,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:41:21,228 INFO L299 CfgBuilder]: Removed 119 assume(true) statements. [2020-12-09 18:41:21,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:21 BoogieIcfgContainer [2020-12-09 18:41:21,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:41:21,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:41:21,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:41:21,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:41:21,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:41:19" (1/3) ... [2020-12-09 18:41:21,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700b07ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:41:21, skipping insertion in model container [2020-12-09 18:41:21,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:41:19" (2/3) ... [2020-12-09 18:41:21,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700b07ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:41:21, skipping insertion in model container [2020-12-09 18:41:21,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:21" (3/3) ... [2020-12-09 18:41:21,236 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-12-09 18:41:21,246 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:41:21,249 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:41:21,257 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:41:21,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:41:21,275 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:41:21,275 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:41:21,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:41:21,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:41:21,275 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:41:21,275 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:41:21,275 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:41:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2020-12-09 18:41:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 18:41:21,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:21,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:21,292 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1744009365, now seen corresponding path program 1 times [2020-12-09 18:41:21,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:21,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367379347] [2020-12-09 18:41:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:21,454 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 18:41:21,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367379347] [2020-12-09 18:41:21,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:21,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:21,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055975707] [2020-12-09 18:41:21,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:21,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:21,470 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2020-12-09 18:41:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:21,609 INFO L93 Difference]: Finished difference Result 444 states and 681 transitions. [2020-12-09 18:41:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:21,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 18:41:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:21,621 INFO L225 Difference]: With dead ends: 444 [2020-12-09 18:41:21,621 INFO L226 Difference]: Without dead ends: 311 [2020-12-09 18:41:21,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-12-09 18:41:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2020-12-09 18:41:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-12-09 18:41:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 408 transitions. [2020-12-09 18:41:21,671 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 408 transitions. Word has length 24 [2020-12-09 18:41:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:21,671 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 408 transitions. [2020-12-09 18:41:21,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 408 transitions. [2020-12-09 18:41:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 18:41:21,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:21,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:21,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 18:41:21,673 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1889624140, now seen corresponding path program 1 times [2020-12-09 18:41:21,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:21,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147928679] [2020-12-09 18:41:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:21,719 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 18:41:21,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147928679] [2020-12-09 18:41:21,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:21,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:21,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6576328] [2020-12-09 18:41:21,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:21,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:21,721 INFO L87 Difference]: Start difference. First operand 279 states and 408 transitions. Second operand 4 states. [2020-12-09 18:41:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:21,843 INFO L93 Difference]: Finished difference Result 1033 states and 1506 transitions. [2020-12-09 18:41:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:21,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 18:41:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:21,849 INFO L225 Difference]: With dead ends: 1033 [2020-12-09 18:41:21,849 INFO L226 Difference]: Without dead ends: 766 [2020-12-09 18:41:21,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-12-09 18:41:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 722. [2020-12-09 18:41:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-12-09 18:41:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1016 transitions. [2020-12-09 18:41:21,889 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1016 transitions. Word has length 24 [2020-12-09 18:41:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:21,889 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 1016 transitions. [2020-12-09 18:41:21,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1016 transitions. [2020-12-09 18:41:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 18:41:21,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:21,891 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 18:41:21,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 18:41:21,892 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1088834387, now seen corresponding path program 1 times [2020-12-09 18:41:21,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:21,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264586686] [2020-12-09 18:41:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:41:21,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264586686] [2020-12-09 18:41:21,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:21,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:21,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192113052] [2020-12-09 18:41:21,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:21,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:21,965 INFO L87 Difference]: Start difference. First operand 722 states and 1016 transitions. Second operand 4 states. [2020-12-09 18:41:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:22,099 INFO L93 Difference]: Finished difference Result 2184 states and 3107 transitions. [2020-12-09 18:41:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:22,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-09 18:41:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:22,106 INFO L225 Difference]: With dead ends: 2184 [2020-12-09 18:41:22,106 INFO L226 Difference]: Without dead ends: 1476 [2020-12-09 18:41:22,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-12-09 18:41:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1179. [2020-12-09 18:41:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2020-12-09 18:41:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1660 transitions. [2020-12-09 18:41:22,147 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1660 transitions. Word has length 33 [2020-12-09 18:41:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:22,147 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1660 transitions. [2020-12-09 18:41:22,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1660 transitions. [2020-12-09 18:41:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 18:41:22,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:22,150 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:22,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 18:41:22,150 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1434823325, now seen corresponding path program 1 times [2020-12-09 18:41:22,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:22,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549841148] [2020-12-09 18:41:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:41:22,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549841148] [2020-12-09 18:41:22,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:22,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:41:22,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162048042] [2020-12-09 18:41:22,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:22,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:22,193 INFO L87 Difference]: Start difference. First operand 1179 states and 1660 transitions. Second operand 3 states. [2020-12-09 18:41:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:22,279 INFO L93 Difference]: Finished difference Result 2899 states and 4114 transitions. [2020-12-09 18:41:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:22,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-09 18:41:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:22,290 INFO L225 Difference]: With dead ends: 2899 [2020-12-09 18:41:22,290 INFO L226 Difference]: Without dead ends: 1734 [2020-12-09 18:41:22,292 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 18:41:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2020-12-09 18:41:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2020-12-09 18:41:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-12-09 18:41:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2454 transitions. [2020-12-09 18:41:22,344 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2454 transitions. Word has length 35 [2020-12-09 18:41:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:22,344 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 2454 transitions. [2020-12-09 18:41:22,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2454 transitions. [2020-12-09 18:41:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 18:41:22,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:22,346 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:22,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 18:41:22,347 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1620848851, now seen corresponding path program 1 times [2020-12-09 18:41:22,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:22,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869092252] [2020-12-09 18:41:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:22,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869092252] [2020-12-09 18:41:22,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:22,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:22,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946562417] [2020-12-09 18:41:22,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:22,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:22,403 INFO L87 Difference]: Start difference. First operand 1732 states and 2454 transitions. Second operand 3 states. [2020-12-09 18:41:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:22,484 INFO L93 Difference]: Finished difference Result 3687 states and 5278 transitions. [2020-12-09 18:41:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:22,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-12-09 18:41:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:22,494 INFO L225 Difference]: With dead ends: 3687 [2020-12-09 18:41:22,494 INFO L226 Difference]: Without dead ends: 2289 [2020-12-09 18:41:22,496 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 18:41:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2020-12-09 18:41:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1854. [2020-12-09 18:41:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2020-12-09 18:41:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2653 transitions. [2020-12-09 18:41:22,563 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2653 transitions. Word has length 37 [2020-12-09 18:41:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:22,564 INFO L481 AbstractCegarLoop]: Abstraction has 1854 states and 2653 transitions. [2020-12-09 18:41:22,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2653 transitions. [2020-12-09 18:41:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 18:41:22,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:22,567 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:22,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 18:41:22,567 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash -618739928, now seen corresponding path program 1 times [2020-12-09 18:41:22,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:22,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648303117] [2020-12-09 18:41:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:41:22,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648303117] [2020-12-09 18:41:22,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:22,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:22,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093885822] [2020-12-09 18:41:22,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:22,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:22,632 INFO L87 Difference]: Start difference. First operand 1854 states and 2653 transitions. Second operand 4 states. [2020-12-09 18:41:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:22,852 INFO L93 Difference]: Finished difference Result 6216 states and 8827 transitions. [2020-12-09 18:41:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:22,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-09 18:41:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:22,870 INFO L225 Difference]: With dead ends: 6216 [2020-12-09 18:41:22,871 INFO L226 Difference]: Without dead ends: 4370 [2020-12-09 18:41:22,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2020-12-09 18:41:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 4007. [2020-12-09 18:41:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2020-12-09 18:41:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5563 transitions. [2020-12-09 18:41:22,999 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5563 transitions. Word has length 52 [2020-12-09 18:41:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:22,999 INFO L481 AbstractCegarLoop]: Abstraction has 4007 states and 5563 transitions. [2020-12-09 18:41:22,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5563 transitions. [2020-12-09 18:41:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 18:41:23,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:23,004 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:23,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 18:41:23,004 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1689163607, now seen corresponding path program 1 times [2020-12-09 18:41:23,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:23,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766735408] [2020-12-09 18:41:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:41:23,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766735408] [2020-12-09 18:41:23,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:23,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:23,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114454150] [2020-12-09 18:41:23,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:23,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:23,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:23,063 INFO L87 Difference]: Start difference. First operand 4007 states and 5563 transitions. Second operand 4 states. [2020-12-09 18:41:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:23,241 INFO L93 Difference]: Finished difference Result 8755 states and 12452 transitions. [2020-12-09 18:41:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:23,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-09 18:41:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:23,263 INFO L225 Difference]: With dead ends: 8755 [2020-12-09 18:41:23,264 INFO L226 Difference]: Without dead ends: 5521 [2020-12-09 18:41:23,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2020-12-09 18:41:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 4007. [2020-12-09 18:41:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2020-12-09 18:41:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5527 transitions. [2020-12-09 18:41:23,407 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5527 transitions. Word has length 52 [2020-12-09 18:41:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:23,407 INFO L481 AbstractCegarLoop]: Abstraction has 4007 states and 5527 transitions. [2020-12-09 18:41:23,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5527 transitions. [2020-12-09 18:41:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-09 18:41:23,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:23,412 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:23,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 18:41:23,412 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -415664156, now seen corresponding path program 1 times [2020-12-09 18:41:23,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:23,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089013532] [2020-12-09 18:41:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:23,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089013532] [2020-12-09 18:41:23,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:23,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:41:23,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887351092] [2020-12-09 18:41:23,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:23,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:23,461 INFO L87 Difference]: Start difference. First operand 4007 states and 5527 transitions. Second operand 4 states. [2020-12-09 18:41:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:23,672 INFO L93 Difference]: Finished difference Result 10600 states and 14618 transitions. [2020-12-09 18:41:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:23,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-09 18:41:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:23,694 INFO L225 Difference]: With dead ends: 10600 [2020-12-09 18:41:23,694 INFO L226 Difference]: Without dead ends: 6006 [2020-12-09 18:41:23,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-12-09 18:41:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 5152. [2020-12-09 18:41:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5152 states. [2020-12-09 18:41:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 6968 transitions. [2020-12-09 18:41:23,859 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 6968 transitions. Word has length 53 [2020-12-09 18:41:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:23,859 INFO L481 AbstractCegarLoop]: Abstraction has 5152 states and 6968 transitions. [2020-12-09 18:41:23,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 6968 transitions. [2020-12-09 18:41:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 18:41:23,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:23,865 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:23,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 18:41:23,865 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1412527895, now seen corresponding path program 1 times [2020-12-09 18:41:23,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:23,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660655383] [2020-12-09 18:41:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:23,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660655383] [2020-12-09 18:41:23,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:23,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:41:23,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742202580] [2020-12-09 18:41:23,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:41:23,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:41:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:23,916 INFO L87 Difference]: Start difference. First operand 5152 states and 6968 transitions. Second operand 5 states. [2020-12-09 18:41:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:24,108 INFO L93 Difference]: Finished difference Result 9007 states and 12435 transitions. [2020-12-09 18:41:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:41:24,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2020-12-09 18:41:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:24,122 INFO L225 Difference]: With dead ends: 9007 [2020-12-09 18:41:24,122 INFO L226 Difference]: Without dead ends: 3868 [2020-12-09 18:41:24,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 18:41:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2020-12-09 18:41:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3130. [2020-12-09 18:41:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-12-09 18:41:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4415 transitions. [2020-12-09 18:41:24,238 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4415 transitions. Word has length 56 [2020-12-09 18:41:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:24,238 INFO L481 AbstractCegarLoop]: Abstraction has 3130 states and 4415 transitions. [2020-12-09 18:41:24,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:41:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4415 transitions. [2020-12-09 18:41:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 18:41:24,241 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:24,241 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:24,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 18:41:24,241 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:24,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1459889549, now seen corresponding path program 1 times [2020-12-09 18:41:24,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:24,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607340530] [2020-12-09 18:41:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:24,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607340530] [2020-12-09 18:41:24,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:24,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:24,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424410639] [2020-12-09 18:41:24,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:24,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:24,270 INFO L87 Difference]: Start difference. First operand 3130 states and 4415 transitions. Second operand 3 states. [2020-12-09 18:41:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:24,401 INFO L93 Difference]: Finished difference Result 7033 states and 9957 transitions. [2020-12-09 18:41:24,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:24,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-09 18:41:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:24,409 INFO L225 Difference]: With dead ends: 7033 [2020-12-09 18:41:24,409 INFO L226 Difference]: Without dead ends: 3949 [2020-12-09 18:41:24,412 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 18:41:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2020-12-09 18:41:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3446. [2020-12-09 18:41:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2020-12-09 18:41:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4897 transitions. [2020-12-09 18:41:24,503 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4897 transitions. Word has length 56 [2020-12-09 18:41:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:24,503 INFO L481 AbstractCegarLoop]: Abstraction has 3446 states and 4897 transitions. [2020-12-09 18:41:24,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4897 transitions. [2020-12-09 18:41:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-09 18:41:24,507 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:24,507 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:24,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 18:41:24,507 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2132659144, now seen corresponding path program 1 times [2020-12-09 18:41:24,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:24,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624062196] [2020-12-09 18:41:24,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:24,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624062196] [2020-12-09 18:41:24,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:24,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:41:24,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751805111] [2020-12-09 18:41:24,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:41:24,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:41:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:24,558 INFO L87 Difference]: Start difference. First operand 3446 states and 4897 transitions. Second operand 5 states. [2020-12-09 18:41:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:24,911 INFO L93 Difference]: Finished difference Result 10425 states and 14602 transitions. [2020-12-09 18:41:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 18:41:24,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2020-12-09 18:41:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:24,925 INFO L225 Difference]: With dead ends: 10425 [2020-12-09 18:41:24,925 INFO L226 Difference]: Without dead ends: 7591 [2020-12-09 18:41:24,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 18:41:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-12-09 18:41:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 4672. [2020-12-09 18:41:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4672 states. [2020-12-09 18:41:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 6544 transitions. [2020-12-09 18:41:25,090 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 6544 transitions. Word has length 70 [2020-12-09 18:41:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:25,090 INFO L481 AbstractCegarLoop]: Abstraction has 4672 states and 6544 transitions. [2020-12-09 18:41:25,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:41:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 6544 transitions. [2020-12-09 18:41:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-09 18:41:25,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:25,094 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:25,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 18:41:25,094 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:25,095 INFO L82 PathProgramCache]: Analyzing trace with hash 489790521, now seen corresponding path program 1 times [2020-12-09 18:41:25,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:25,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794732241] [2020-12-09 18:41:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:25,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794732241] [2020-12-09 18:41:25,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:25,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:25,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901258492] [2020-12-09 18:41:25,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:25,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:25,130 INFO L87 Difference]: Start difference. First operand 4672 states and 6544 transitions. Second operand 3 states. [2020-12-09 18:41:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:25,259 INFO L93 Difference]: Finished difference Result 8666 states and 12111 transitions. [2020-12-09 18:41:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:25,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-09 18:41:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:25,266 INFO L225 Difference]: With dead ends: 8666 [2020-12-09 18:41:25,266 INFO L226 Difference]: Without dead ends: 4606 [2020-12-09 18:41:25,270 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 18:41:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2020-12-09 18:41:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 4580. [2020-12-09 18:41:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2020-12-09 18:41:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 6197 transitions. [2020-12-09 18:41:25,415 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 6197 transitions. Word has length 70 [2020-12-09 18:41:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:25,415 INFO L481 AbstractCegarLoop]: Abstraction has 4580 states and 6197 transitions. [2020-12-09 18:41:25,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 6197 transitions. [2020-12-09 18:41:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-09 18:41:25,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:25,419 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:25,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 18:41:25,419 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash -895155977, now seen corresponding path program 1 times [2020-12-09 18:41:25,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:25,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269659026] [2020-12-09 18:41:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:41:25,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269659026] [2020-12-09 18:41:25,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863093513] [2020-12-09 18:41:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:25,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 18:41:25,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:41:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 18:41:25,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:41:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 18:41:25,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:41:25,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2020-12-09 18:41:25,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560920304] [2020-12-09 18:41:25,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:25,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:25,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:41:25,714 INFO L87 Difference]: Start difference. First operand 4580 states and 6197 transitions. Second operand 3 states. [2020-12-09 18:41:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:26,103 INFO L93 Difference]: Finished difference Result 12236 states and 16453 transitions. [2020-12-09 18:41:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:26,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-12-09 18:41:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:26,113 INFO L225 Difference]: With dead ends: 12236 [2020-12-09 18:41:26,113 INFO L226 Difference]: Without dead ends: 7670 [2020-12-09 18:41:26,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 18:41:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2020-12-09 18:41:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7668. [2020-12-09 18:41:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7668 states. [2020-12-09 18:41:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 10201 transitions. [2020-12-09 18:41:26,476 INFO L78 Accepts]: Start accepts. Automaton has 7668 states and 10201 transitions. Word has length 71 [2020-12-09 18:41:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:26,476 INFO L481 AbstractCegarLoop]: Abstraction has 7668 states and 10201 transitions. [2020-12-09 18:41:26,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7668 states and 10201 transitions. [2020-12-09 18:41:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 18:41:26,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:26,486 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:26,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 18:41:26,687 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1127486970, now seen corresponding path program 1 times [2020-12-09 18:41:26,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:26,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659142403] [2020-12-09 18:41:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:26,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659142403] [2020-12-09 18:41:26,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:26,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:26,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878106871] [2020-12-09 18:41:26,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:26,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:26,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:26,726 INFO L87 Difference]: Start difference. First operand 7668 states and 10201 transitions. Second operand 3 states. [2020-12-09 18:41:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:26,980 INFO L93 Difference]: Finished difference Result 13713 states and 18316 transitions. [2020-12-09 18:41:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:26,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-09 18:41:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:26,988 INFO L225 Difference]: With dead ends: 13713 [2020-12-09 18:41:26,988 INFO L226 Difference]: Without dead ends: 6101 [2020-12-09 18:41:26,994 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 18:41:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6101 states. [2020-12-09 18:41:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6101 to 6066. [2020-12-09 18:41:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2020-12-09 18:41:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7892 transitions. [2020-12-09 18:41:27,171 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7892 transitions. Word has length 72 [2020-12-09 18:41:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:27,171 INFO L481 AbstractCegarLoop]: Abstraction has 6066 states and 7892 transitions. [2020-12-09 18:41:27,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7892 transitions. [2020-12-09 18:41:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 18:41:27,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:27,176 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:27,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 18:41:27,176 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash 160707559, now seen corresponding path program 1 times [2020-12-09 18:41:27,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:27,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340018161] [2020-12-09 18:41:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:41:27,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340018161] [2020-12-09 18:41:27,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:27,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:27,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765371014] [2020-12-09 18:41:27,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:27,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:27,211 INFO L87 Difference]: Start difference. First operand 6066 states and 7892 transitions. Second operand 4 states. [2020-12-09 18:41:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:27,487 INFO L93 Difference]: Finished difference Result 12681 states and 16570 transitions. [2020-12-09 18:41:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:27,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-09 18:41:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:27,496 INFO L225 Difference]: With dead ends: 12681 [2020-12-09 18:41:27,496 INFO L226 Difference]: Without dead ends: 8184 [2020-12-09 18:41:27,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8184 states. [2020-12-09 18:41:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8184 to 6066. [2020-12-09 18:41:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2020-12-09 18:41:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7772 transitions. [2020-12-09 18:41:27,702 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7772 transitions. Word has length 72 [2020-12-09 18:41:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:27,702 INFO L481 AbstractCegarLoop]: Abstraction has 6066 states and 7772 transitions. [2020-12-09 18:41:27,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7772 transitions. [2020-12-09 18:41:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-09 18:41:27,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:27,707 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:27,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 18:41:27,707 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash 183080945, now seen corresponding path program 1 times [2020-12-09 18:41:27,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:27,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301917179] [2020-12-09 18:41:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:41:27,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301917179] [2020-12-09 18:41:27,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092417130] [2020-12-09 18:41:27,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 18:41:27,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:41:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:27,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:41:27,970 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-12-09 18:41:27,970 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:41:27,972 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-12-09 18:41:27,972 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:41:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:28,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [576839343] [2020-12-09 18:41:28,037 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2020-12-09 18:41:28,037 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:41:28,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:41:28,044 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:41:28,045 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:41:30,423 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 18:41:31,805 WARN L197 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 156 DAG size of output: 152 [2020-12-09 18:41:31,965 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2020-12-09 18:41:32,159 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2020-12-09 18:41:32,354 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2020-12-09 18:41:32,620 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2020-12-09 18:41:32,859 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2020-12-09 18:41:33,154 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2020-12-09 18:41:33,441 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2020-12-09 18:41:33,797 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 108 [2020-12-09 18:41:34,165 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 112 [2020-12-09 18:41:34,660 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 121 [2020-12-09 18:41:35,169 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 129 [2020-12-09 18:41:35,747 WARN L197 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2020-12-09 18:41:36,047 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-12-09 18:41:36,596 WARN L197 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 138 [2020-12-09 18:41:36,836 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-12-09 18:41:37,333 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2020-12-09 18:41:37,746 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 119 [2020-12-09 18:41:38,266 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2020-12-09 18:41:38,695 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2020-12-09 18:41:39,285 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 122 [2020-12-09 18:41:39,760 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2020-12-09 18:41:40,249 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 123 [2020-12-09 18:41:40,734 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 125 [2020-12-09 18:41:41,249 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 130 [2020-12-09 18:41:42,042 WARN L197 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-12-09 18:41:42,923 WARN L197 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-12-09 18:41:44,471 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 150 DAG size of output: 147 [2020-12-09 18:41:45,267 WARN L197 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-12-09 18:41:46,677 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 151 DAG size of output: 148 [2020-12-09 18:41:47,485 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-12-09 18:41:48,350 WARN L197 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-12-09 18:41:49,819 WARN L197 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 154 DAG size of output: 152 [2020-12-09 18:41:49,924 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:41:49,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:41:49,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2020-12-09 18:41:49,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456380690] [2020-12-09 18:41:49,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 18:41:49,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 18:41:49,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 18:41:49,926 INFO L87 Difference]: Start difference. First operand 6066 states and 7772 transitions. Second operand 9 states. [2020-12-09 18:41:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:50,606 INFO L93 Difference]: Finished difference Result 14576 states and 19137 transitions. [2020-12-09 18:41:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 18:41:50,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2020-12-09 18:41:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:50,614 INFO L225 Difference]: With dead ends: 14576 [2020-12-09 18:41:50,614 INFO L226 Difference]: Without dead ends: 9630 [2020-12-09 18:41:50,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 174 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2020-12-09 18:41:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9630 states. [2020-12-09 18:41:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9630 to 4925. [2020-12-09 18:41:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4925 states. [2020-12-09 18:41:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6409 transitions. [2020-12-09 18:41:50,819 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6409 transitions. Word has length 73 [2020-12-09 18:41:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:50,820 INFO L481 AbstractCegarLoop]: Abstraction has 4925 states and 6409 transitions. [2020-12-09 18:41:50,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 18:41:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6409 transitions. [2020-12-09 18:41:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 18:41:50,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:50,824 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:51,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-09 18:41:51,026 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 553981072, now seen corresponding path program 1 times [2020-12-09 18:41:51,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:51,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362052976] [2020-12-09 18:41:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:51,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362052976] [2020-12-09 18:41:51,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:51,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:41:51,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803285097] [2020-12-09 18:41:51,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:51,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:51,065 INFO L87 Difference]: Start difference. First operand 4925 states and 6409 transitions. Second operand 4 states. [2020-12-09 18:41:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:51,339 INFO L93 Difference]: Finished difference Result 10093 states and 13126 transitions. [2020-12-09 18:41:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:51,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-09 18:41:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:51,344 INFO L225 Difference]: With dead ends: 10093 [2020-12-09 18:41:51,344 INFO L226 Difference]: Without dead ends: 6405 [2020-12-09 18:41:51,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:41:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2020-12-09 18:41:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 5689. [2020-12-09 18:41:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2020-12-09 18:41:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 7323 transitions. [2020-12-09 18:41:51,556 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 7323 transitions. Word has length 74 [2020-12-09 18:41:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:51,557 INFO L481 AbstractCegarLoop]: Abstraction has 5689 states and 7323 transitions. [2020-12-09 18:41:51,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 7323 transitions. [2020-12-09 18:41:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-09 18:41:51,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:51,561 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:51,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2020-12-09 18:41:51,561 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1412891180, now seen corresponding path program 1 times [2020-12-09 18:41:51,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:51,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118566669] [2020-12-09 18:41:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:51,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118566669] [2020-12-09 18:41:51,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:51,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:41:51,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344951851] [2020-12-09 18:41:51,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:41:51,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:51,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:41:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:51,604 INFO L87 Difference]: Start difference. First operand 5689 states and 7323 transitions. Second operand 5 states. [2020-12-09 18:41:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:51,857 INFO L93 Difference]: Finished difference Result 9085 states and 11786 transitions. [2020-12-09 18:41:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 18:41:51,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2020-12-09 18:41:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:51,861 INFO L225 Difference]: With dead ends: 9085 [2020-12-09 18:41:51,861 INFO L226 Difference]: Without dead ends: 4718 [2020-12-09 18:41:51,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 18:41:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2020-12-09 18:41:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4620. [2020-12-09 18:41:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2020-12-09 18:41:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 5955 transitions. [2020-12-09 18:41:52,053 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 5955 transitions. Word has length 74 [2020-12-09 18:41:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:52,053 INFO L481 AbstractCegarLoop]: Abstraction has 4620 states and 5955 transitions. [2020-12-09 18:41:52,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:41:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 5955 transitions. [2020-12-09 18:41:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-09 18:41:52,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:52,056 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:52,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2020-12-09 18:41:52,057 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1693538037, now seen corresponding path program 1 times [2020-12-09 18:41:52,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:52,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729151381] [2020-12-09 18:41:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:52,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729151381] [2020-12-09 18:41:52,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:52,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:52,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795268606] [2020-12-09 18:41:52,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:52,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:52,085 INFO L87 Difference]: Start difference. First operand 4620 states and 5955 transitions. Second operand 3 states. [2020-12-09 18:41:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:52,266 INFO L93 Difference]: Finished difference Result 8639 states and 11244 transitions. [2020-12-09 18:41:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:52,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-09 18:41:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:52,269 INFO L225 Difference]: With dead ends: 8639 [2020-12-09 18:41:52,270 INFO L226 Difference]: Without dead ends: 4075 [2020-12-09 18:41:52,273 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 18:41:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2020-12-09 18:41:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3848. [2020-12-09 18:41:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2020-12-09 18:41:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5046 transitions. [2020-12-09 18:41:52,423 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5046 transitions. Word has length 75 [2020-12-09 18:41:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:52,423 INFO L481 AbstractCegarLoop]: Abstraction has 3848 states and 5046 transitions. [2020-12-09 18:41:52,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5046 transitions. [2020-12-09 18:41:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-09 18:41:52,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:52,426 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:52,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2020-12-09 18:41:52,426 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1850588742, now seen corresponding path program 1 times [2020-12-09 18:41:52,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:52,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539605650] [2020-12-09 18:41:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:52,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539605650] [2020-12-09 18:41:52,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:52,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:41:52,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462091473] [2020-12-09 18:41:52,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:41:52,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:41:52,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:41:52,462 INFO L87 Difference]: Start difference. First operand 3848 states and 5046 transitions. Second operand 5 states. [2020-12-09 18:41:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:52,705 INFO L93 Difference]: Finished difference Result 7931 states and 10520 transitions. [2020-12-09 18:41:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 18:41:52,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2020-12-09 18:41:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:52,709 INFO L225 Difference]: With dead ends: 7931 [2020-12-09 18:41:52,709 INFO L226 Difference]: Without dead ends: 4361 [2020-12-09 18:41:52,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 18:41:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2020-12-09 18:41:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 3952. [2020-12-09 18:41:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2020-12-09 18:41:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5149 transitions. [2020-12-09 18:41:52,875 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5149 transitions. Word has length 75 [2020-12-09 18:41:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:52,875 INFO L481 AbstractCegarLoop]: Abstraction has 3952 states and 5149 transitions. [2020-12-09 18:41:52,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:41:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5149 transitions. [2020-12-09 18:41:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-09 18:41:52,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:52,878 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:52,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-12-09 18:41:52,879 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash 260193765, now seen corresponding path program 1 times [2020-12-09 18:41:52,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:52,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261195884] [2020-12-09 18:41:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:52,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261195884] [2020-12-09 18:41:52,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:41:52,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:41:52,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445987858] [2020-12-09 18:41:52,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 18:41:52,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 18:41:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 18:41:52,901 INFO L87 Difference]: Start difference. First operand 3952 states and 5149 transitions. Second operand 3 states. [2020-12-09 18:41:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:53,035 INFO L93 Difference]: Finished difference Result 6236 states and 8161 transitions. [2020-12-09 18:41:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 18:41:53,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-09 18:41:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:53,037 INFO L225 Difference]: With dead ends: 6236 [2020-12-09 18:41:53,037 INFO L226 Difference]: Without dead ends: 2602 [2020-12-09 18:41:53,040 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 18:41:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-12-09 18:41:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2584. [2020-12-09 18:41:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2584 states. [2020-12-09 18:41:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3252 transitions. [2020-12-09 18:41:53,153 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3252 transitions. Word has length 75 [2020-12-09 18:41:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:53,154 INFO L481 AbstractCegarLoop]: Abstraction has 2584 states and 3252 transitions. [2020-12-09 18:41:53,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 18:41:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3252 transitions. [2020-12-09 18:41:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-09 18:41:53,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:53,156 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:53,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2020-12-09 18:41:53,156 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 834238937, now seen corresponding path program 1 times [2020-12-09 18:41:53,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:53,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132565612] [2020-12-09 18:41:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:53,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132565612] [2020-12-09 18:41:53,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85209119] [2020-12-09 18:41:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:53,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 18:41:53,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:41:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:53,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:41:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:53,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:41:53,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 12 [2020-12-09 18:41:53,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954815137] [2020-12-09 18:41:53,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:53,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:41:53,422 INFO L87 Difference]: Start difference. First operand 2584 states and 3252 transitions. Second operand 4 states. [2020-12-09 18:41:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:53,630 INFO L93 Difference]: Finished difference Result 5397 states and 6770 transitions. [2020-12-09 18:41:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:41:53,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-09 18:41:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:53,633 INFO L225 Difference]: With dead ends: 5397 [2020-12-09 18:41:53,634 INFO L226 Difference]: Without dead ends: 3317 [2020-12-09 18:41:53,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 18:41:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2020-12-09 18:41:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2148. [2020-12-09 18:41:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2020-12-09 18:41:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2650 transitions. [2020-12-09 18:41:53,738 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 2650 transitions. Word has length 76 [2020-12-09 18:41:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:53,738 INFO L481 AbstractCegarLoop]: Abstraction has 2148 states and 2650 transitions. [2020-12-09 18:41:53,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2650 transitions. [2020-12-09 18:41:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-09 18:41:53,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:53,740 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:53,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2020-12-09 18:41:53,942 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1364419163, now seen corresponding path program 1 times [2020-12-09 18:41:53,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:53,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672186253] [2020-12-09 18:41:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:54,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672186253] [2020-12-09 18:41:54,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619216877] [2020-12-09 18:41:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:54,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:41:54,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:41:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:54,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:41:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:54,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:41:54,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [9] total 11 [2020-12-09 18:41:54,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143545089] [2020-12-09 18:41:54,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:54,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:41:54,198 INFO L87 Difference]: Start difference. First operand 2148 states and 2650 transitions. Second operand 4 states. [2020-12-09 18:41:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:54,312 INFO L93 Difference]: Finished difference Result 3751 states and 4632 transitions. [2020-12-09 18:41:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:54,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-09 18:41:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:54,314 INFO L225 Difference]: With dead ends: 3751 [2020-12-09 18:41:54,314 INFO L226 Difference]: Without dead ends: 2016 [2020-12-09 18:41:54,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:41:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2020-12-09 18:41:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1940. [2020-12-09 18:41:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-12-09 18:41:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2366 transitions. [2020-12-09 18:41:54,409 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2366 transitions. Word has length 77 [2020-12-09 18:41:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:54,409 INFO L481 AbstractCegarLoop]: Abstraction has 1940 states and 2366 transitions. [2020-12-09 18:41:54,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2366 transitions. [2020-12-09 18:41:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-09 18:41:54,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:54,411 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:41:54,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:41:54,612 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash 716098102, now seen corresponding path program 1 times [2020-12-09 18:41:54,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:54,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728020935] [2020-12-09 18:41:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:41:54,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728020935] [2020-12-09 18:41:54,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632764140] [2020-12-09 18:41:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/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 18:41:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:41:54,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:41:54,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:41:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:54,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:41:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 18:41:54,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:41:54,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [9] total 11 [2020-12-09 18:41:54,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878793890] [2020-12-09 18:41:54,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:41:54,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:41:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:41:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:41:54,908 INFO L87 Difference]: Start difference. First operand 1940 states and 2366 transitions. Second operand 4 states. [2020-12-09 18:41:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:41:55,029 INFO L93 Difference]: Finished difference Result 3415 states and 4166 transitions. [2020-12-09 18:41:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:41:55,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-09 18:41:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:41:55,031 INFO L225 Difference]: With dead ends: 3415 [2020-12-09 18:41:55,031 INFO L226 Difference]: Without dead ends: 1944 [2020-12-09 18:41:55,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:41:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2020-12-09 18:41:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1940. [2020-12-09 18:41:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2020-12-09 18:41:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2358 transitions. [2020-12-09 18:41:55,128 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2358 transitions. Word has length 77 [2020-12-09 18:41:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:41:55,128 INFO L481 AbstractCegarLoop]: Abstraction has 1940 states and 2358 transitions. [2020-12-09 18:41:55,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:41:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2358 transitions. [2020-12-09 18:41:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-09 18:41:55,130 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:41:55,130 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:55,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:41:55,332 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:41:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:41:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -856759573, now seen corresponding path program 1 times [2020-12-09 18:41:55,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:41:55,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214525950] [2020-12-09 18:41:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:41:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:41:55,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:41:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:41:55,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:41:55,431 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 18:41:55,431 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 18:41:55,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2020-12-09 18:41:55,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:41:55 BoogieIcfgContainer [2020-12-09 18:41:55,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:41:55,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:41:55,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:41:55,534 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:41:55,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:41:21" (3/4) ... [2020-12-09 18:41:55,537 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 18:41:55,637 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c7bffe2b-0849-4781-840f-953f9bc6102a/bin/utaipan/witness.graphml [2020-12-09 18:41:55,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:41:55,638 INFO L168 Benchmark]: Toolchain (without parser) took 35967.91 ms. Allocated memory was 94.4 MB in the beginning and 918.6 MB in the end (delta: 824.2 MB). Free memory was 54.5 MB in the beginning and 496.6 MB in the end (delta: -442.2 MB). Peak memory consumption was 382.6 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,638 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 94.4 MB. Free memory is still 70.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:41:55,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.46 ms. Allocated memory is still 94.4 MB. Free memory was 54.4 MB in the beginning and 63.7 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 94.4 MB. Free memory was 63.7 MB in the beginning and 60.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,639 INFO L168 Benchmark]: Boogie Preprocessor took 36.13 ms. Allocated memory is still 94.4 MB. Free memory was 60.1 MB in the beginning and 57.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,639 INFO L168 Benchmark]: RCFGBuilder took 1260.15 ms. Allocated memory was 94.4 MB in the beginning and 132.1 MB in the end (delta: 37.7 MB). Free memory was 57.1 MB in the beginning and 73.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,639 INFO L168 Benchmark]: TraceAbstraction took 34302.30 ms. Allocated memory was 132.1 MB in the beginning and 918.6 MB in the end (delta: 786.4 MB). Free memory was 72.8 MB in the beginning and 514.4 MB in the end (delta: -441.7 MB). Peak memory consumption was 345.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,640 INFO L168 Benchmark]: Witness Printer took 102.89 ms. Allocated memory is still 918.6 MB. Free memory was 514.4 MB in the beginning and 496.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 18:41:55,641 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 94.4 MB. Free memory is still 70.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 222.46 ms. Allocated memory is still 94.4 MB. Free memory was 54.4 MB in the beginning and 63.7 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 94.4 MB. Free memory was 63.7 MB in the beginning and 60.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.13 ms. Allocated memory is still 94.4 MB. Free memory was 60.1 MB in the beginning and 57.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1260.15 ms. Allocated memory was 94.4 MB in the beginning and 132.1 MB in the end (delta: 37.7 MB). Free memory was 57.1 MB in the beginning and 73.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34302.30 ms. Allocated memory was 132.1 MB in the beginning and 918.6 MB in the end (delta: 786.4 MB). Free memory was 72.8 MB in the beginning and 514.4 MB in the end (delta: -441.7 MB). Peak memory consumption was 345.8 MB. Max. memory is 16.1 GB. * Witness Printer took 102.89 ms. Allocated memory is still 918.6 MB. Free memory was 514.4 MB in the beginning and 496.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 [L273] COND TRUE m_i == 1 [L274] m_st = 0 [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 [L410] COND FALSE !(M_E == 0) [L415] COND FALSE !(T1_E == 0) [L420] COND FALSE !(T2_E == 0) [L425] COND FALSE !(T3_E == 0) [L430] COND FALSE !(E_1 == 0) [L435] COND FALSE !(E_2 == 0) [L440] COND FALSE !(E_3 == 0) [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L189] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L208] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L227] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L246] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L256] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L453] COND FALSE !(M_E == 1) [L458] COND FALSE !(T1_E == 1) [L463] COND FALSE !(T2_E == 1) [L468] COND FALSE !(T3_E == 1) [L473] COND FALSE !(E_1 == 1) [L478] COND FALSE !(E_2 == 1) [L483] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L644] COND TRUE 1 [L647] kernel_st = 1 [L329] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L333] COND TRUE 1 [L298] int __retres1 ; [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 [L324] return (__retres1); [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L86] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L97] COND TRUE 1 [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L121] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L132] COND TRUE 1 [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L156] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L167] COND TRUE 1 [L169] t3_pc = 1 [L170] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L333] COND TRUE 1 [L298] int __retres1 ; [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 [L324] return (__retres1); [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND TRUE \read(tmp_ndt_1) [L348] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L45] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L56] COND TRUE 1 [L59] E_1 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND TRUE E_1 == 1 [L210] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND TRUE \read(tmp___0) [L511] t1_st = 0 [L224] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L61] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L66] m_pc = 1 [L67] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L86] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L89] COND TRUE t1_pc == 1 [L105] E_2 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND TRUE E_2 == 1 [L229] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND TRUE \read(tmp___1) [L519] t2_st = 0 [L243] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L107] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE 1 [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L121] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L124] COND TRUE t2_pc == 1 [L140] E_3 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND TRUE E_3 == 1 [L248] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND TRUE \read(tmp___2) [L527] t3_st = 0 [L142] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L132] COND TRUE 1 [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L156] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L159] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 34.1s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5156 SDtfs, 6141 SDslu, 6384 SDs, 0 SdLazy, 1066 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 968 GetRequests, 817 SyntacticMatches, 14 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7668occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 17304 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1923 NumberOfCodeBlocks, 1923 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2167 ConstructedInterpolants, 0 QuantifiedInterpolants, 356835 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1787 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 421/432 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...