./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.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_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI --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 ba5ca2b9b2a5f86416453e0608f62cc01593f29e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2021-10-11 02:23:01,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:23:01,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:23:01,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:23:01,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:23:01,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:23:01,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:23:01,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:23:01,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:23:01,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:23:01,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:23:01,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:23:01,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:23:01,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:23:01,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:23:01,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:23:01,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:23:01,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:23:01,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:23:01,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:23:01,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:23:01,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:23:01,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:23:01,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:23:01,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:23:01,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:23:01,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:23:01,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:23:01,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:23:01,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:23:01,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:23:01,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:23:01,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:23:01,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:23:01,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:23:01,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:23:01,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:23:01,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:23:01,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:23:01,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:23:01,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:23:01,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:23:01,955 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:23:01,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:23:01,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:23:01,957 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:23:01,958 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:23:01,958 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:23:01,958 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:23:01,958 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:23:01,959 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:23:01,959 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:23:01,966 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:23:01,967 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:23:01,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:23:01,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:23:01,967 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:23:01,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:23:01,969 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:23:01,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:23:01,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:23:01,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:23:01,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:23:01,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:23:01,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:23:01,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:23:01,970 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:23:01,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:23:01,971 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:23:01,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:23:01,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:23:01,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:23:01,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:01,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:23:01,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:23:01,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:23:01,975 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:23:01,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:23:01,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:23:01,975 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:23:01,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:23:01,976 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI 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 -> ba5ca2b9b2a5f86416453e0608f62cc01593f29e [2021-10-11 02:23:02,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:23:02,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:23:02,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:23:02,280 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:23:02,282 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:23:02,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-11 02:23:02,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/data/0f59884c8/1d0a6de0e7814d8db7c1f53e0e47d149/FLAGfd5dc2665 [2021-10-11 02:23:02,859 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:23:02,859 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-10-11 02:23:02,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/data/0f59884c8/1d0a6de0e7814d8db7c1f53e0e47d149/FLAGfd5dc2665 [2021-10-11 02:23:03,224 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/data/0f59884c8/1d0a6de0e7814d8db7c1f53e0e47d149 [2021-10-11 02:23:03,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:23:03,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:23:03,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:03,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:23:03,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:23:03,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2816cb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03, skipping insertion in model container [2021-10-11 02:23:03,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:23:03,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:23:03,445 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-11 02:23:03,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:03,524 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:23:03,535 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] [2021-10-11 02:23:03,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:03,596 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:23:03,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03 WrapperNode [2021-10-11 02:23:03,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:03,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:03,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:23:03,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:23:03,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:03,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:23:03,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:23:03,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:23:03,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... [2021-10-11 02:23:03,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:23:03,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:23:03,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:23:03,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:23:03,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:23:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:23:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:23:03,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:23:06,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:23:06,048 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-10-11 02:23:06,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:06 BoogieIcfgContainer [2021-10-11 02:23:06,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:23:06,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:23:06,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:23:06,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:23:06,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:23:03" (1/3) ... [2021-10-11 02:23:06,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a77fb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:06, skipping insertion in model container [2021-10-11 02:23:06,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:03" (2/3) ... [2021-10-11 02:23:06,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a77fb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:06, skipping insertion in model container [2021-10-11 02:23:06,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:06" (3/3) ... [2021-10-11 02:23:06,065 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-10-11 02:23:06,083 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:23:06,087 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:23:06,099 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-11 02:23:06,138 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:23:06,139 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:23:06,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:23:06,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:23:06,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:23:06,140 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:23:06,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:23:06,140 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2021-10-11 02:23:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:06,165 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:06,166 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] [2021-10-11 02:23:06,166 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1014639220, now seen corresponding path program 1 times [2021-10-11 02:23:06,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39219540] [2021-10-11 02:23:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:06,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39219540] [2021-10-11 02:23:06,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:06,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:06,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74883979] [2021-10-11 02:23:06,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:06,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:06,368 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2021-10-11 02:23:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:06,490 INFO L93 Difference]: Finished difference Result 416 states and 639 transitions. [2021-10-11 02:23:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:06,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-10-11 02:23:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:06,506 INFO L225 Difference]: With dead ends: 416 [2021-10-11 02:23:06,506 INFO L226 Difference]: Without dead ends: 264 [2021-10-11 02:23:06,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-11 02:23:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2021-10-11 02:23:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-10-11 02:23:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2021-10-11 02:23:06,570 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 22 [2021-10-11 02:23:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:06,570 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2021-10-11 02:23:06,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2021-10-11 02:23:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:06,574 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:06,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:06,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:06,574 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1608201124, now seen corresponding path program 1 times [2021-10-11 02:23:06,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286958058] [2021-10-11 02:23:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:23:06,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286958058] [2021-10-11 02:23:06,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:06,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:06,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105268729] [2021-10-11 02:23:06,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:06,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:06,652 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 3 states. [2021-10-11 02:23:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:06,712 INFO L93 Difference]: Finished difference Result 684 states and 1014 transitions. [2021-10-11 02:23:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:06,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-10-11 02:23:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:06,717 INFO L225 Difference]: With dead ends: 684 [2021-10-11 02:23:06,718 INFO L226 Difference]: Without dead ends: 443 [2021-10-11 02:23:06,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-11 02:23:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 437. [2021-10-11 02:23:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2021-10-11 02:23:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 639 transitions. [2021-10-11 02:23:06,754 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 639 transitions. Word has length 43 [2021-10-11 02:23:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:06,754 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 639 transitions. [2021-10-11 02:23:06,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 639 transitions. [2021-10-11 02:23:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:06,758 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:06,758 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:06,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:23:06,758 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash -156615485, now seen corresponding path program 1 times [2021-10-11 02:23:06,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683080404] [2021-10-11 02:23:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:23:06,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683080404] [2021-10-11 02:23:06,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:06,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:06,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844423230] [2021-10-11 02:23:06,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:06,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:06,835 INFO L87 Difference]: Start difference. First operand 437 states and 639 transitions. Second operand 4 states. [2021-10-11 02:23:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:06,975 INFO L93 Difference]: Finished difference Result 1499 states and 2184 transitions. [2021-10-11 02:23:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:06,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2021-10-11 02:23:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:06,982 INFO L225 Difference]: With dead ends: 1499 [2021-10-11 02:23:06,982 INFO L226 Difference]: Without dead ends: 1067 [2021-10-11 02:23:06,985 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 [2021-10-11 02:23:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-10-11 02:23:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2021-10-11 02:23:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2021-10-11 02:23:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1461 transitions. [2021-10-11 02:23:07,051 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1461 transitions. Word has length 43 [2021-10-11 02:23:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,051 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1461 transitions. [2021-10-11 02:23:07,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1461 transitions. [2021-10-11 02:23:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:07,056 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,056 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:07,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:23:07,056 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2076200574, now seen corresponding path program 1 times [2021-10-11 02:23:07,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887300615] [2021-10-11 02:23:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:07,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887300615] [2021-10-11 02:23:07,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:07,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625365129] [2021-10-11 02:23:07,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:07,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:07,140 INFO L87 Difference]: Start difference. First operand 1031 states and 1461 transitions. Second operand 3 states. [2021-10-11 02:23:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,215 INFO L93 Difference]: Finished difference Result 1778 states and 2576 transitions. [2021-10-11 02:23:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:07,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-10-11 02:23:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,223 INFO L225 Difference]: With dead ends: 1778 [2021-10-11 02:23:07,223 INFO L226 Difference]: Without dead ends: 1192 [2021-10-11 02:23:07,225 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 [2021-10-11 02:23:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-10-11 02:23:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1126. [2021-10-11 02:23:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2021-10-11 02:23:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1623 transitions. [2021-10-11 02:23:07,270 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1623 transitions. Word has length 43 [2021-10-11 02:23:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,270 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1623 transitions. [2021-10-11 02:23:07,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1623 transitions. [2021-10-11 02:23:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-11 02:23:07,275 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,275 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:07,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:23:07,275 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1582402054, now seen corresponding path program 1 times [2021-10-11 02:23:07,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609871499] [2021-10-11 02:23:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:07,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609871499] [2021-10-11 02:23:07,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:07,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963122439] [2021-10-11 02:23:07,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:07,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:07,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:07,438 INFO L87 Difference]: Start difference. First operand 1126 states and 1623 transitions. Second operand 3 states. [2021-10-11 02:23:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,539 INFO L93 Difference]: Finished difference Result 1882 states and 2729 transitions. [2021-10-11 02:23:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:07,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-10-11 02:23:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,547 INFO L225 Difference]: With dead ends: 1882 [2021-10-11 02:23:07,547 INFO L226 Difference]: Without dead ends: 1201 [2021-10-11 02:23:07,549 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 [2021-10-11 02:23:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2021-10-11 02:23:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1126. [2021-10-11 02:23:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2021-10-11 02:23:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1584 transitions. [2021-10-11 02:23:07,598 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1584 transitions. Word has length 62 [2021-10-11 02:23:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,600 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1584 transitions. [2021-10-11 02:23:07,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1584 transitions. [2021-10-11 02:23:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-11 02:23:07,604 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,604 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:07,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:23:07,605 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 7992923, now seen corresponding path program 1 times [2021-10-11 02:23:07,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559114691] [2021-10-11 02:23:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:07,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559114691] [2021-10-11 02:23:07,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:07,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808701448] [2021-10-11 02:23:07,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:07,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:07,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:07,802 INFO L87 Difference]: Start difference. First operand 1126 states and 1584 transitions. Second operand 4 states. [2021-10-11 02:23:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,023 INFO L93 Difference]: Finished difference Result 3173 states and 4482 transitions. [2021-10-11 02:23:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:08,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-10-11 02:23:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,038 INFO L225 Difference]: With dead ends: 3173 [2021-10-11 02:23:08,038 INFO L226 Difference]: Without dead ends: 2060 [2021-10-11 02:23:08,041 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 [2021-10-11 02:23:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-10-11 02:23:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1616. [2021-10-11 02:23:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2021-10-11 02:23:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2271 transitions. [2021-10-11 02:23:08,156 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2271 transitions. Word has length 62 [2021-10-11 02:23:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,163 INFO L481 AbstractCegarLoop]: Abstraction has 1616 states and 2271 transitions. [2021-10-11 02:23:08,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2271 transitions. [2021-10-11 02:23:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 02:23:08,168 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,169 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:08,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:23:08,169 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -70146800, now seen corresponding path program 1 times [2021-10-11 02:23:08,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672043776] [2021-10-11 02:23:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:08,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672043776] [2021-10-11 02:23:08,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:08,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:08,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425472970] [2021-10-11 02:23:08,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:08,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:08,288 INFO L87 Difference]: Start difference. First operand 1616 states and 2271 transitions. Second operand 4 states. [2021-10-11 02:23:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,548 INFO L93 Difference]: Finished difference Result 5094 states and 7219 transitions. [2021-10-11 02:23:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-10-11 02:23:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,570 INFO L225 Difference]: With dead ends: 5094 [2021-10-11 02:23:08,570 INFO L226 Difference]: Without dead ends: 3491 [2021-10-11 02:23:08,575 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 [2021-10-11 02:23:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2021-10-11 02:23:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 2655. [2021-10-11 02:23:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2021-10-11 02:23:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3721 transitions. [2021-10-11 02:23:08,728 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3721 transitions. Word has length 63 [2021-10-11 02:23:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,728 INFO L481 AbstractCegarLoop]: Abstraction has 2655 states and 3721 transitions. [2021-10-11 02:23:08,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3721 transitions. [2021-10-11 02:23:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-11 02:23:08,734 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,734 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:08,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:23:08,734 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash 288256388, now seen corresponding path program 1 times [2021-10-11 02:23:08,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038422795] [2021-10-11 02:23:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:08,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038422795] [2021-10-11 02:23:08,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:08,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:08,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591958859] [2021-10-11 02:23:08,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:08,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:08,847 INFO L87 Difference]: Start difference. First operand 2655 states and 3721 transitions. Second operand 5 states. [2021-10-11 02:23:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,176 INFO L93 Difference]: Finished difference Result 7310 states and 10337 transitions. [2021-10-11 02:23:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:09,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2021-10-11 02:23:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,204 INFO L225 Difference]: With dead ends: 7310 [2021-10-11 02:23:09,204 INFO L226 Difference]: Without dead ends: 4668 [2021-10-11 02:23:09,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2021-10-11 02:23:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 3132. [2021-10-11 02:23:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2021-10-11 02:23:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4435 transitions. [2021-10-11 02:23:09,435 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4435 transitions. Word has length 64 [2021-10-11 02:23:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,436 INFO L481 AbstractCegarLoop]: Abstraction has 3132 states and 4435 transitions. [2021-10-11 02:23:09,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4435 transitions. [2021-10-11 02:23:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-11 02:23:09,443 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,443 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:09,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:23:09,443 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1324866526, now seen corresponding path program 1 times [2021-10-11 02:23:09,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175366221] [2021-10-11 02:23:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:09,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175366221] [2021-10-11 02:23:09,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:09,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972010043] [2021-10-11 02:23:09,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:09,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:09,498 INFO L87 Difference]: Start difference. First operand 3132 states and 4435 transitions. Second operand 4 states. [2021-10-11 02:23:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,803 INFO L93 Difference]: Finished difference Result 7701 states and 11052 transitions. [2021-10-11 02:23:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:09,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-10-11 02:23:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,831 INFO L225 Difference]: With dead ends: 7701 [2021-10-11 02:23:09,831 INFO L226 Difference]: Without dead ends: 4582 [2021-10-11 02:23:09,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2021-10-11 02:23:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 3211. [2021-10-11 02:23:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3211 states. [2021-10-11 02:23:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4555 transitions. [2021-10-11 02:23:10,054 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4555 transitions. Word has length 65 [2021-10-11 02:23:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,056 INFO L481 AbstractCegarLoop]: Abstraction has 3211 states and 4555 transitions. [2021-10-11 02:23:10,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4555 transitions. [2021-10-11 02:23:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-11 02:23:10,067 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,068 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:23:10,068 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1392692706, now seen corresponding path program 1 times [2021-10-11 02:23:10,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840970118] [2021-10-11 02:23:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840970118] [2021-10-11 02:23:10,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951581712] [2021-10-11 02:23:10,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,134 INFO L87 Difference]: Start difference. First operand 3211 states and 4555 transitions. Second operand 3 states. [2021-10-11 02:23:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,347 INFO L93 Difference]: Finished difference Result 5525 states and 7870 transitions. [2021-10-11 02:23:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-10-11 02:23:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,365 INFO L225 Difference]: With dead ends: 5525 [2021-10-11 02:23:10,365 INFO L226 Difference]: Without dead ends: 3224 [2021-10-11 02:23:10,369 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 [2021-10-11 02:23:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2021-10-11 02:23:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3193. [2021-10-11 02:23:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3193 states. [2021-10-11 02:23:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4399 transitions. [2021-10-11 02:23:10,542 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4399 transitions. Word has length 69 [2021-10-11 02:23:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,543 INFO L481 AbstractCegarLoop]: Abstraction has 3193 states and 4399 transitions. [2021-10-11 02:23:10,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4399 transitions. [2021-10-11 02:23:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-11 02:23:10,549 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,549 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:23:10,550 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 252340995, now seen corresponding path program 1 times [2021-10-11 02:23:10,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550493587] [2021-10-11 02:23:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550493587] [2021-10-11 02:23:10,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562751090] [2021-10-11 02:23:10,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,600 INFO L87 Difference]: Start difference. First operand 3193 states and 4399 transitions. Second operand 3 states. [2021-10-11 02:23:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,807 INFO L93 Difference]: Finished difference Result 6179 states and 8529 transitions. [2021-10-11 02:23:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-10-11 02:23:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,825 INFO L225 Difference]: With dead ends: 6179 [2021-10-11 02:23:10,825 INFO L226 Difference]: Without dead ends: 3193 [2021-10-11 02:23:10,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2021-10-11 02:23:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3193. [2021-10-11 02:23:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3193 states. [2021-10-11 02:23:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4315 transitions. [2021-10-11 02:23:10,997 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4315 transitions. Word has length 69 [2021-10-11 02:23:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,997 INFO L481 AbstractCegarLoop]: Abstraction has 3193 states and 4315 transitions. [2021-10-11 02:23:10,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4315 transitions. [2021-10-11 02:23:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-11 02:23:11,004 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,004 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:23:11,004 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -721147964, now seen corresponding path program 1 times [2021-10-11 02:23:11,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516348583] [2021-10-11 02:23:11,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516348583] [2021-10-11 02:23:11,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:11,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142987922] [2021-10-11 02:23:11,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:11,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:11,069 INFO L87 Difference]: Start difference. First operand 3193 states and 4315 transitions. Second operand 3 states. [2021-10-11 02:23:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,280 INFO L93 Difference]: Finished difference Result 7090 states and 9647 transitions. [2021-10-11 02:23:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:11,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-10-11 02:23:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,291 INFO L225 Difference]: With dead ends: 7090 [2021-10-11 02:23:11,291 INFO L226 Difference]: Without dead ends: 4104 [2021-10-11 02:23:11,296 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 [2021-10-11 02:23:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2021-10-11 02:23:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4055. [2021-10-11 02:23:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4055 states. [2021-10-11 02:23:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 5374 transitions. [2021-10-11 02:23:11,538 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 5374 transitions. Word has length 69 [2021-10-11 02:23:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,538 INFO L481 AbstractCegarLoop]: Abstraction has 4055 states and 5374 transitions. [2021-10-11 02:23:11,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 5374 transitions. [2021-10-11 02:23:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-11 02:23:11,547 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,548 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:23:11,548 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1079498974, now seen corresponding path program 1 times [2021-10-11 02:23:11,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454287292] [2021-10-11 02:23:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454287292] [2021-10-11 02:23:11,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981461823] [2021-10-11 02:23:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:23:11,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:12,088 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2021-10-11 02:23:12,089 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:12,092 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2021-10-11 02:23:12,092 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:12,093 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2021-10-11 02:23:12,094 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:12,095 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:23:12,095 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:12,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [4] total 11 [2021-10-11 02:23:12,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698192231] [2021-10-11 02:23:12,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:23:12,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:23:12,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:23:12,173 INFO L87 Difference]: Start difference. First operand 4055 states and 5374 transitions. Second operand 8 states. [2021-10-11 02:23:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,217 INFO L93 Difference]: Finished difference Result 8635 states and 11411 transitions. [2021-10-11 02:23:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-11 02:23:13,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2021-10-11 02:23:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,233 INFO L225 Difference]: With dead ends: 8635 [2021-10-11 02:23:13,233 INFO L226 Difference]: Without dead ends: 6543 [2021-10-11 02:23:13,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:23:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2021-10-11 02:23:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 4021. [2021-10-11 02:23:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2021-10-11 02:23:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5346 transitions. [2021-10-11 02:23:13,556 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5346 transitions. Word has length 70 [2021-10-11 02:23:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,557 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 5346 transitions. [2021-10-11 02:23:13,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:23:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5346 transitions. [2021-10-11 02:23:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:13,565 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,566 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:23:13,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-11 02:23:13,788 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash 61611273, now seen corresponding path program 1 times [2021-10-11 02:23:13,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061730330] [2021-10-11 02:23:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:13,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061730330] [2021-10-11 02:23:13,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479396301] [2021-10-11 02:23:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:23:13,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:14,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-11 02:23:14,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463776] [2021-10-11 02:23:14,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:14,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:14,131 INFO L87 Difference]: Start difference. First operand 4021 states and 5346 transitions. Second operand 4 states. [2021-10-11 02:23:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:14,465 INFO L93 Difference]: Finished difference Result 8648 states and 11499 transitions. [2021-10-11 02:23:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:14,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-10-11 02:23:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:14,476 INFO L225 Difference]: With dead ends: 8648 [2021-10-11 02:23:14,477 INFO L226 Difference]: Without dead ends: 4836 [2021-10-11 02:23:14,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2021-10-11 02:23:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4253. [2021-10-11 02:23:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4253 states. [2021-10-11 02:23:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5674 transitions. [2021-10-11 02:23:14,795 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5674 transitions. Word has length 72 [2021-10-11 02:23:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:14,795 INFO L481 AbstractCegarLoop]: Abstraction has 4253 states and 5674 transitions. [2021-10-11 02:23:14,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5674 transitions. [2021-10-11 02:23:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:14,805 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:14,805 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:15,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-11 02:23:15,033 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1273669487, now seen corresponding path program 1 times [2021-10-11 02:23:15,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186636679] [2021-10-11 02:23:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:23:15,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186636679] [2021-10-11 02:23:15,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:15,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:15,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57674597] [2021-10-11 02:23:15,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:15,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:15,092 INFO L87 Difference]: Start difference. First operand 4253 states and 5674 transitions. Second operand 3 states. [2021-10-11 02:23:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:15,435 INFO L93 Difference]: Finished difference Result 7133 states and 9450 transitions. [2021-10-11 02:23:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:15,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-10-11 02:23:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:15,449 INFO L225 Difference]: With dead ends: 7133 [2021-10-11 02:23:15,450 INFO L226 Difference]: Without dead ends: 3932 [2021-10-11 02:23:15,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2021-10-11 02:23:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3755. [2021-10-11 02:23:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3755 states. [2021-10-11 02:23:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4944 transitions. [2021-10-11 02:23:15,686 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4944 transitions. Word has length 72 [2021-10-11 02:23:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:15,687 INFO L481 AbstractCegarLoop]: Abstraction has 3755 states and 4944 transitions. [2021-10-11 02:23:15,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4944 transitions. [2021-10-11 02:23:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:15,694 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:15,695 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:23:15,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:23:15,695 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1462748321, now seen corresponding path program 1 times [2021-10-11 02:23:15,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740710246] [2021-10-11 02:23:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740710246] [2021-10-11 02:23:15,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798433889] [2021-10-11 02:23:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:23:15,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:16,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-11 02:23:16,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540129922] [2021-10-11 02:23:16,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:16,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:16,044 INFO L87 Difference]: Start difference. First operand 3755 states and 4944 transitions. Second operand 4 states. [2021-10-11 02:23:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,312 INFO L93 Difference]: Finished difference Result 7101 states and 9385 transitions. [2021-10-11 02:23:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:16,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-10-11 02:23:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,322 INFO L225 Difference]: With dead ends: 7101 [2021-10-11 02:23:16,322 INFO L226 Difference]: Without dead ends: 4266 [2021-10-11 02:23:16,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2021-10-11 02:23:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3747. [2021-10-11 02:23:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3747 states. [2021-10-11 02:23:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 4957 transitions. [2021-10-11 02:23:16,550 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 4957 transitions. Word has length 72 [2021-10-11 02:23:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,550 INFO L481 AbstractCegarLoop]: Abstraction has 3747 states and 4957 transitions. [2021-10-11 02:23:16,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 4957 transitions. [2021-10-11 02:23:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:16,560 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,560 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-11 02:23:16,780 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,781 INFO L82 PathProgramCache]: Analyzing trace with hash -695333511, now seen corresponding path program 1 times [2021-10-11 02:23:16,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805554189] [2021-10-11 02:23:16,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805554189] [2021-10-11 02:23:16,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762603813] [2021-10-11 02:23:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:17,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:23:17,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:17,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:17,139 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:23:17,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:17,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:17,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-11 02:23:17,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985499500] [2021-10-11 02:23:17,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:17,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:17,211 INFO L87 Difference]: Start difference. First operand 3747 states and 4957 transitions. Second operand 4 states. [2021-10-11 02:23:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:17,483 INFO L93 Difference]: Finished difference Result 7373 states and 9757 transitions. [2021-10-11 02:23:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:17,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-10-11 02:23:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:17,491 INFO L225 Difference]: With dead ends: 7373 [2021-10-11 02:23:17,492 INFO L226 Difference]: Without dead ends: 3757 [2021-10-11 02:23:17,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2021-10-11 02:23:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3747. [2021-10-11 02:23:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3747 states. [2021-10-11 02:23:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 4908 transitions. [2021-10-11 02:23:17,736 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 4908 transitions. Word has length 72 [2021-10-11 02:23:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:17,737 INFO L481 AbstractCegarLoop]: Abstraction has 3747 states and 4908 transitions. [2021-10-11 02:23:17,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 4908 transitions. [2021-10-11 02:23:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:17,745 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:17,745 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:17,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:17,972 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1765757190, now seen corresponding path program 1 times [2021-10-11 02:23:17,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:17,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906323134] [2021-10-11 02:23:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:18,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906323134] [2021-10-11 02:23:18,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:18,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:18,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241911543] [2021-10-11 02:23:18,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:18,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:18,063 INFO L87 Difference]: Start difference. First operand 3747 states and 4908 transitions. Second operand 3 states. [2021-10-11 02:23:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:18,249 INFO L93 Difference]: Finished difference Result 6314 states and 8285 transitions. [2021-10-11 02:23:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:18,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-10-11 02:23:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:18,256 INFO L225 Difference]: With dead ends: 6314 [2021-10-11 02:23:18,256 INFO L226 Difference]: Without dead ends: 2698 [2021-10-11 02:23:18,261 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 [2021-10-11 02:23:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2021-10-11 02:23:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2662. [2021-10-11 02:23:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2021-10-11 02:23:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3393 transitions. [2021-10-11 02:23:18,441 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3393 transitions. Word has length 72 [2021-10-11 02:23:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:18,441 INFO L481 AbstractCegarLoop]: Abstraction has 2662 states and 3393 transitions. [2021-10-11 02:23:18,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3393 transitions. [2021-10-11 02:23:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 02:23:18,444 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:18,445 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:23:18,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:23:18,445 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:18,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 213828052, now seen corresponding path program 1 times [2021-10-11 02:23:18,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:18,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247586997] [2021-10-11 02:23:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:18,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247586997] [2021-10-11 02:23:18,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:18,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:18,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781781193] [2021-10-11 02:23:18,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:18,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:18,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:18,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:18,478 INFO L87 Difference]: Start difference. First operand 2662 states and 3393 transitions. Second operand 3 states. [2021-10-11 02:23:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:18,714 INFO L93 Difference]: Finished difference Result 6069 states and 7773 transitions. [2021-10-11 02:23:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:18,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-10-11 02:23:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:18,723 INFO L225 Difference]: With dead ends: 6069 [2021-10-11 02:23:18,723 INFO L226 Difference]: Without dead ends: 3409 [2021-10-11 02:23:18,727 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 [2021-10-11 02:23:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2021-10-11 02:23:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 2894. [2021-10-11 02:23:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2021-10-11 02:23:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3687 transitions. [2021-10-11 02:23:18,991 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3687 transitions. Word has length 72 [2021-10-11 02:23:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:18,991 INFO L481 AbstractCegarLoop]: Abstraction has 2894 states and 3687 transitions. [2021-10-11 02:23:18,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3687 transitions. [2021-10-11 02:23:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-11 02:23:18,996 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:18,997 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:18,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:23:18,997 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 733174964, now seen corresponding path program 1 times [2021-10-11 02:23:18,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:18,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879985030] [2021-10-11 02:23:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:19,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879985030] [2021-10-11 02:23:19,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713503370] [2021-10-11 02:23:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:23:19,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:19,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:19,312 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:23:19,313 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:19,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:19,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-11 02:23:19,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758514596] [2021-10-11 02:23:19,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:19,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:19,387 INFO L87 Difference]: Start difference. First operand 2894 states and 3687 transitions. Second operand 4 states. [2021-10-11 02:23:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:19,616 INFO L93 Difference]: Finished difference Result 5052 states and 6431 transitions. [2021-10-11 02:23:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:19,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-10-11 02:23:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:19,624 INFO L225 Difference]: With dead ends: 5052 [2021-10-11 02:23:19,625 INFO L226 Difference]: Without dead ends: 2942 [2021-10-11 02:23:19,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2021-10-11 02:23:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2894. [2021-10-11 02:23:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2021-10-11 02:23:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3641 transitions. [2021-10-11 02:23:19,870 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3641 transitions. Word has length 73 [2021-10-11 02:23:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:19,870 INFO L481 AbstractCegarLoop]: Abstraction has 2894 states and 3641 transitions. [2021-10-11 02:23:19,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3641 transitions. [2021-10-11 02:23:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-11 02:23:19,875 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:19,875 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:20,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:20,091 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash 923124338, now seen corresponding path program 1 times [2021-10-11 02:23:20,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:20,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342066444] [2021-10-11 02:23:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:20,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342066444] [2021-10-11 02:23:20,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865158960] [2021-10-11 02:23:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:20,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:23:20,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:20,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:20,405 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:23:20,405 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:23:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:20,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:20,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-11 02:23:20,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420209468] [2021-10-11 02:23:20,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:20,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:20,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:20,475 INFO L87 Difference]: Start difference. First operand 2894 states and 3641 transitions. Second operand 4 states. [2021-10-11 02:23:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:20,704 INFO L93 Difference]: Finished difference Result 5004 states and 6272 transitions. [2021-10-11 02:23:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:20,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-10-11 02:23:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:20,712 INFO L225 Difference]: With dead ends: 5004 [2021-10-11 02:23:20,712 INFO L226 Difference]: Without dead ends: 3005 [2021-10-11 02:23:20,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2021-10-11 02:23:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2894. [2021-10-11 02:23:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2021-10-11 02:23:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3596 transitions. [2021-10-11 02:23:20,922 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3596 transitions. Word has length 74 [2021-10-11 02:23:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:20,922 INFO L481 AbstractCegarLoop]: Abstraction has 2894 states and 3596 transitions. [2021-10-11 02:23:20,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3596 transitions. [2021-10-11 02:23:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 02:23:20,927 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:20,927 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:21,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:21,152 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 327257622, now seen corresponding path program 1 times [2021-10-11 02:23:21,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:21,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830343063] [2021-10-11 02:23:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:21,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830343063] [2021-10-11 02:23:21,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503350151] [2021-10-11 02:23:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:21,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:23:21,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:21,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:21,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:21,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 9 [2021-10-11 02:23:21,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054569591] [2021-10-11 02:23:21,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:21,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:21,590 INFO L87 Difference]: Start difference. First operand 2894 states and 3596 transitions. Second operand 6 states. [2021-10-11 02:23:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:22,091 INFO L93 Difference]: Finished difference Result 7628 states and 9316 transitions. [2021-10-11 02:23:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:22,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2021-10-11 02:23:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:22,101 INFO L225 Difference]: With dead ends: 7628 [2021-10-11 02:23:22,101 INFO L226 Difference]: Without dead ends: 4276 [2021-10-11 02:23:22,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-10-11 02:23:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 2985. [2021-10-11 02:23:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2021-10-11 02:23:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 3559 transitions. [2021-10-11 02:23:22,302 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 3559 transitions. Word has length 75 [2021-10-11 02:23:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:22,303 INFO L481 AbstractCegarLoop]: Abstraction has 2985 states and 3559 transitions. [2021-10-11 02:23:22,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3559 transitions. [2021-10-11 02:23:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 02:23:22,306 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:22,306 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:22,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:22,523 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1614285433, now seen corresponding path program 1 times [2021-10-11 02:23:22,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:22,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115880854] [2021-10-11 02:23:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:22,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115880854] [2021-10-11 02:23:22,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:22,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:22,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831517574] [2021-10-11 02:23:22,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:22,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:22,575 INFO L87 Difference]: Start difference. First operand 2985 states and 3559 transitions. Second operand 4 states. [2021-10-11 02:23:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:22,923 INFO L93 Difference]: Finished difference Result 6146 states and 7285 transitions. [2021-10-11 02:23:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:22,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-10-11 02:23:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:22,931 INFO L225 Difference]: With dead ends: 6146 [2021-10-11 02:23:22,932 INFO L226 Difference]: Without dead ends: 3610 [2021-10-11 02:23:22,935 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 [2021-10-11 02:23:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2021-10-11 02:23:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3000. [2021-10-11 02:23:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2021-10-11 02:23:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 3521 transitions. [2021-10-11 02:23:23,158 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 3521 transitions. Word has length 75 [2021-10-11 02:23:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:23,158 INFO L481 AbstractCegarLoop]: Abstraction has 3000 states and 3521 transitions. [2021-10-11 02:23:23,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 3521 transitions. [2021-10-11 02:23:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-11 02:23:23,162 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:23,162 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:23,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:23:23,162 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1559292901, now seen corresponding path program 1 times [2021-10-11 02:23:23,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:23,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454840383] [2021-10-11 02:23:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:23,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454840383] [2021-10-11 02:23:23,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:23,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:23,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619284852] [2021-10-11 02:23:23,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:23,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:23,211 INFO L87 Difference]: Start difference. First operand 3000 states and 3521 transitions. Second operand 4 states. [2021-10-11 02:23:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:23,538 INFO L93 Difference]: Finished difference Result 6450 states and 7534 transitions. [2021-10-11 02:23:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:23,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-10-11 02:23:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:23,547 INFO L225 Difference]: With dead ends: 6450 [2021-10-11 02:23:23,547 INFO L226 Difference]: Without dead ends: 3789 [2021-10-11 02:23:23,551 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 [2021-10-11 02:23:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2021-10-11 02:23:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3231. [2021-10-11 02:23:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3231 states. [2021-10-11 02:23:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 3729 transitions. [2021-10-11 02:23:23,850 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 3729 transitions. Word has length 96 [2021-10-11 02:23:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:23,851 INFO L481 AbstractCegarLoop]: Abstraction has 3231 states and 3729 transitions. [2021-10-11 02:23:23,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 3729 transitions. [2021-10-11 02:23:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-11 02:23:23,854 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:23,854 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:23,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 02:23:23,855 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1329882479, now seen corresponding path program 1 times [2021-10-11 02:23:23,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:23,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220564969] [2021-10-11 02:23:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:23:23,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220564969] [2021-10-11 02:23:23,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:23,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:23,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77204633] [2021-10-11 02:23:23,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:23,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:24,000 INFO L87 Difference]: Start difference. First operand 3231 states and 3729 transitions. Second operand 6 states. [2021-10-11 02:23:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:24,808 INFO L93 Difference]: Finished difference Result 10667 states and 12244 transitions. [2021-10-11 02:23:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:24,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2021-10-11 02:23:24,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:24,829 INFO L225 Difference]: With dead ends: 10667 [2021-10-11 02:23:24,829 INFO L226 Difference]: Without dead ends: 8702 [2021-10-11 02:23:24,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8702 states. [2021-10-11 02:23:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8702 to 6100. [2021-10-11 02:23:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6100 states. [2021-10-11 02:23:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 7020 transitions. [2021-10-11 02:23:25,386 INFO L78 Accepts]: Start accepts. Automaton has 6100 states and 7020 transitions. Word has length 118 [2021-10-11 02:23:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:25,386 INFO L481 AbstractCegarLoop]: Abstraction has 6100 states and 7020 transitions. [2021-10-11 02:23:25,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6100 states and 7020 transitions. [2021-10-11 02:23:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-11 02:23:25,390 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:25,390 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:25,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 02:23:25,391 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:25,391 INFO L82 PathProgramCache]: Analyzing trace with hash -778064320, now seen corresponding path program 1 times [2021-10-11 02:23:25,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:25,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969662075] [2021-10-11 02:23:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:23:25,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:23:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:23:25,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:23:25,510 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:23:25,510 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:23:25,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-11 02:23:25,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:25 BoogieIcfgContainer [2021-10-11 02:23:25,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:25,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:25,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:25,689 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:25,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:06" (3/4) ... [2021-10-11 02:23:25,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:23:25,896 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9601d38-7c2f-490d-b7a6-6f7ea3d846ba/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:25,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:25,898 INFO L168 Benchmark]: Toolchain (without parser) took 22669.76 ms. Allocated memory was 100.7 MB in the beginning and 954.2 MB in the end (delta: 853.5 MB). Free memory was 67.2 MB in the beginning and 687.3 MB in the end (delta: -620.1 MB). Peak memory consumption was 233.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,899 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 100.7 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:25,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.90 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 67.0 MB in the beginning and 92.5 MB in the end (delta: -25.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.47 ms. Allocated memory is still 121.6 MB. Free memory was 92.5 MB in the beginning and 88.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,900 INFO L168 Benchmark]: Boogie Preprocessor took 55.13 ms. Allocated memory is still 121.6 MB. Free memory was 88.8 MB in the beginning and 85.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,901 INFO L168 Benchmark]: RCFGBuilder took 2305.52 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 85.7 MB in the beginning and 82.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 50.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,901 INFO L168 Benchmark]: TraceAbstraction took 19631.86 ms. Allocated memory was 146.8 MB in the beginning and 954.2 MB in the end (delta: 807.4 MB). Free memory was 81.1 MB in the beginning and 712.5 MB in the end (delta: -631.4 MB). Peak memory consumption was 177.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,902 INFO L168 Benchmark]: Witness Printer took 208.37 ms. Allocated memory is still 954.2 MB. Free memory was 712.5 MB in the beginning and 687.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:25,904 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.19 ms. Allocated memory is still 100.7 MB. Free memory is still 54.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 364.90 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 67.0 MB in the beginning and 92.5 MB in the end (delta: -25.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.47 ms. Allocated memory is still 121.6 MB. Free memory was 92.5 MB in the beginning and 88.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.13 ms. Allocated memory is still 121.6 MB. Free memory was 88.8 MB in the beginning and 85.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2305.52 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 85.7 MB in the beginning and 82.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 50.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19631.86 ms. Allocated memory was 146.8 MB in the beginning and 954.2 MB in the end (delta: 807.4 MB). Free memory was 81.1 MB in the beginning and 712.5 MB in the end (delta: -631.4 MB). Peak memory consumption was 177.0 MB. Max. memory is 16.1 GB. * Witness Printer took 208.37 ms. Allocated memory is still 954.2 MB. Free memory was 712.5 MB in the beginning and 687.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int t3_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 [L296] COND TRUE m_i == 1 [L297] m_st = 0 [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 [L433] COND FALSE !(M_E == 0) [L438] COND FALSE !(T1_E == 0) [L443] COND FALSE !(T2_E == 0) [L448] COND FALSE !(T3_E == 0) [L453] COND FALSE !(E_M == 0) [L458] COND FALSE !(E_1 == 0) [L463] COND FALSE !(E_2 == 0) [L468] COND FALSE !(E_3 == 0) [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L481] COND FALSE !(M_E == 1) [L486] COND FALSE !(T1_E == 1) [L491] COND FALSE !(T2_E == 1) [L496] COND FALSE !(T3_E == 1) [L501] COND FALSE !(E_M == 1) [L506] COND FALSE !(E_1 == 1) [L511] COND FALSE !(E_2 == 1) [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L682] COND TRUE 1 [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L59] COND TRUE 1 [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=0] [L107] COND TRUE t1_pc == 1 [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, 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, token=1] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L115] COND TRUE 1 [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=1] [L143] COND TRUE t2_pc == 1 [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, 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, token=2] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L151] COND TRUE 1 [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, 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, token=2] [L179] COND TRUE t3_pc == 1 [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, 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, token=3] [L224] return (__retres1); [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L243] return (__retres1); [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L262] return (__retres1); [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L281] return (__retres1); [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=3] [L187] COND TRUE 1 [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L356] COND TRUE 1 [L321] int __retres1 ; [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 [L347] return (__retres1); [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L73] COND FALSE !(token != local + 3) [L78] COND TRUE tmp_var <= 5 [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.3s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6485 SDtfs, 5830 SDslu, 8694 SDs, 0 SdLazy, 1219 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1133 GetRequests, 1046 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6100occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 14046 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2664 ConstructedInterpolants, 0 QuantifiedInterpolants, 466319 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2528 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 39 InterpolantComputations, 32 PerfectInterpolantSequences, 455/473 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...