./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d58fadf54daed6107b58402b79d250d23d0301 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:00:49,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:00:49,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:00:49,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:00:49,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:00:49,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:00:49,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:00:49,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:00:49,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:00:49,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:00:49,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:00:49,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:00:49,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:00:49,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:00:49,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:00:49,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:00:49,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:00:49,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:00:49,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:00:49,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:00:49,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:00:49,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:00:49,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:00:49,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:00:49,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:00:49,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:00:49,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:00:49,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:00:49,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:00:49,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:00:49,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:00:49,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:00:49,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:00:49,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:00:49,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:00:49,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:00:49,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:00:49,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:00:49,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:00:49,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:00:49,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:00:49,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:00:49,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:00:49,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:00:49,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:00:49,932 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:00:49,932 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:00:49,933 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:00:49,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:00:49,933 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:00:49,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:00:49,933 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:00:49,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:00:49,934 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:00:49,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:00:49,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:00:49,934 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:00:49,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:00:49,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:00:49,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:00:49,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:00:49,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:00:49,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:00:49,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:00:49,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:00:49,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:00:49,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:00:49,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:00:49,937 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:00:49,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:00:49,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:00:49,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:00:49,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:00:49,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:00:49,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:00:49,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:00:49,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:00:49,940 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> e3d58fadf54daed6107b58402b79d250d23d0301 [2019-12-07 20:00:50,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:00:50,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:00:50,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:00:50,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:00:50,087 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:00:50,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2019-12-07 20:00:50,126 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/data/9b5cd0258/cc4cf10a5c0e46379e9479e230b38ecf/FLAGb28c5a3d7 [2019-12-07 20:00:50,585 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:00:50,586 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2019-12-07 20:00:50,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/data/9b5cd0258/cc4cf10a5c0e46379e9479e230b38ecf/FLAGb28c5a3d7 [2019-12-07 20:00:50,601 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/data/9b5cd0258/cc4cf10a5c0e46379e9479e230b38ecf [2019-12-07 20:00:50,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:00:50,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:00:50,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:00:50,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:00:50,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:00:50,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3a36ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50, skipping insertion in model container [2019-12-07 20:00:50,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:00:50,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:00:50,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:00:50,801 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:00:50,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:00:50,839 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:00:50,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50 WrapperNode [2019-12-07 20:00:50,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:00:50,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:00:50,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:00:50,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:00:50,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:00:50,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:00:50,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:00:50,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:00:50,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... [2019-12-07 20:00:50,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:00:50,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:00:50,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:00:50,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:00:50,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:00:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:00:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:00:51,749 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:00:51,749 INFO L287 CfgBuilder]: Removed 103 assume(true) statements. [2019-12-07 20:00:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:00:51 BoogieIcfgContainer [2019-12-07 20:00:51,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:00:51,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:00:51,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:00:51,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:00:51,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:00:50" (1/3) ... [2019-12-07 20:00:51,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4937fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:00:51, skipping insertion in model container [2019-12-07 20:00:51,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:00:50" (2/3) ... [2019-12-07 20:00:51,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4937fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:00:51, skipping insertion in model container [2019-12-07 20:00:51,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:00:51" (3/3) ... [2019-12-07 20:00:51,755 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-12-07 20:00:51,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:00:51,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:00:51,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:00:51,790 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:00:51,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:00:51,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:00:51,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:00:51,791 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:00:51,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:00:51,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:00:51,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:00:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-07 20:00:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:00:51,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:51,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:51,809 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:51,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1367945884, now seen corresponding path program 1 times [2019-12-07 20:00:51,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:51,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568965581] [2019-12-07 20:00:51,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:51,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568965581] [2019-12-07 20:00:51,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:51,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:00:51,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661460568] [2019-12-07 20:00:51,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:51,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:51,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:51,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:51,933 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-07 20:00:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:51,999 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-12-07 20:00:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:52,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 20:00:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,009 INFO L225 Difference]: With dead ends: 276 [2019-12-07 20:00:52,009 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 20:00:52,012 INFO L630 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 [2019-12-07 20:00:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 20:00:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2019-12-07 20:00:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 20:00:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2019-12-07 20:00:52,048 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 19 [2019-12-07 20:00:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,048 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2019-12-07 20:00:52,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2019-12-07 20:00:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:00:52,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,050 INFO L410 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] [2019-12-07 20:00:52,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2096870180, now seen corresponding path program 1 times [2019-12-07 20:00:52,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100324242] [2019-12-07 20:00:52,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:00:52,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100324242] [2019-12-07 20:00:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:52,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:00:52,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426218008] [2019-12-07 20:00:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:52,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:52,088 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand 3 states. [2019-12-07 20:00:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,125 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2019-12-07 20:00:52,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:52,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 20:00:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,128 INFO L225 Difference]: With dead ends: 444 [2019-12-07 20:00:52,128 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 20:00:52,129 INFO L630 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 [2019-12-07 20:00:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 20:00:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-12-07 20:00:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 20:00:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2019-12-07 20:00:52,147 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 36 [2019-12-07 20:00:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,147 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2019-12-07 20:00:52,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2019-12-07 20:00:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:00:52,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,149 INFO L410 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] [2019-12-07 20:00:52,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1279122493, now seen corresponding path program 1 times [2019-12-07 20:00:52,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721156659] [2019-12-07 20:00:52,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:52,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721156659] [2019-12-07 20:00:52,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:52,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:52,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995948285] [2019-12-07 20:00:52,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:52,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:52,204 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand 3 states. [2019-12-07 20:00:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,247 INFO L93 Difference]: Finished difference Result 775 states and 1112 transitions. [2019-12-07 20:00:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:52,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 20:00:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,250 INFO L225 Difference]: With dead ends: 775 [2019-12-07 20:00:52,250 INFO L226 Difference]: Without dead ends: 502 [2019-12-07 20:00:52,251 INFO L630 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 [2019-12-07 20:00:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-07 20:00:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2019-12-07 20:00:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-07 20:00:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions. [2019-12-07 20:00:52,273 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 36 [2019-12-07 20:00:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,273 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions. [2019-12-07 20:00:52,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions. [2019-12-07 20:00:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:00:52,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,276 INFO L410 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] [2019-12-07 20:00:52,276 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1736520068, now seen corresponding path program 1 times [2019-12-07 20:00:52,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152129975] [2019-12-07 20:00:52,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:52,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152129975] [2019-12-07 20:00:52,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:52,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:00:52,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171617134] [2019-12-07 20:00:52,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:00:52,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:00:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:00:52,341 INFO L87 Difference]: Start difference. First operand 488 states and 687 transitions. Second operand 6 states. [2019-12-07 20:00:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,445 INFO L93 Difference]: Finished difference Result 939 states and 1363 transitions. [2019-12-07 20:00:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:00:52,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 20:00:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,450 INFO L225 Difference]: With dead ends: 939 [2019-12-07 20:00:52,450 INFO L226 Difference]: Without dead ends: 663 [2019-12-07 20:00:52,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:00:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-12-07 20:00:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 578. [2019-12-07 20:00:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-07 20:00:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 827 transitions. [2019-12-07 20:00:52,473 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 827 transitions. Word has length 36 [2019-12-07 20:00:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,473 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 827 transitions. [2019-12-07 20:00:52,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:00:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 827 transitions. [2019-12-07 20:00:52,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:00:52,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,475 INFO L410 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] [2019-12-07 20:00:52,476 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 398861694, now seen corresponding path program 1 times [2019-12-07 20:00:52,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87007828] [2019-12-07 20:00:52,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:52,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87007828] [2019-12-07 20:00:52,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:52,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:52,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426763761] [2019-12-07 20:00:52,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:52,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:52,534 INFO L87 Difference]: Start difference. First operand 578 states and 827 transitions. Second operand 3 states. [2019-12-07 20:00:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,565 INFO L93 Difference]: Finished difference Result 980 states and 1410 transitions. [2019-12-07 20:00:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:52,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 20:00:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,568 INFO L225 Difference]: With dead ends: 980 [2019-12-07 20:00:52,568 INFO L226 Difference]: Without dead ends: 614 [2019-12-07 20:00:52,569 INFO L630 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 [2019-12-07 20:00:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-07 20:00:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 578. [2019-12-07 20:00:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-07 20:00:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 803 transitions. [2019-12-07 20:00:52,584 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 803 transitions. Word has length 52 [2019-12-07 20:00:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,584 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 803 transitions. [2019-12-07 20:00:52,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 803 transitions. [2019-12-07 20:00:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:00:52,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,585 INFO L410 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] [2019-12-07 20:00:52,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1372350653, now seen corresponding path program 1 times [2019-12-07 20:00:52,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820326226] [2019-12-07 20:00:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:52,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820326226] [2019-12-07 20:00:52,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:52,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:52,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720001554] [2019-12-07 20:00:52,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:00:52,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:00:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:52,646 INFO L87 Difference]: Start difference. First operand 578 states and 803 transitions. Second operand 4 states. [2019-12-07 20:00:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,681 INFO L93 Difference]: Finished difference Result 953 states and 1333 transitions. [2019-12-07 20:00:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:00:52,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 20:00:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,684 INFO L225 Difference]: With dead ends: 953 [2019-12-07 20:00:52,684 INFO L226 Difference]: Without dead ends: 595 [2019-12-07 20:00:52,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-07 20:00:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 578. [2019-12-07 20:00:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-07 20:00:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 789 transitions. [2019-12-07 20:00:52,700 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 789 transitions. Word has length 52 [2019-12-07 20:00:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,701 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 789 transitions. [2019-12-07 20:00:52,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:00:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 789 transitions. [2019-12-07 20:00:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:00:52,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,702 INFO L410 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] [2019-12-07 20:00:52,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1602334248, now seen corresponding path program 1 times [2019-12-07 20:00:52,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:52,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187815052] [2019-12-07 20:00:52,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:52,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187815052] [2019-12-07 20:00:52,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101894331] [2019-12-07 20:00:52,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:52,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:00:52,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:52,834 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:52,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:00:52,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 20:00:52,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350919354] [2019-12-07 20:00:52,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:52,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:00:52,846 INFO L87 Difference]: Start difference. First operand 578 states and 789 transitions. Second operand 3 states. [2019-12-07 20:00:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:52,894 INFO L93 Difference]: Finished difference Result 1337 states and 1828 transitions. [2019-12-07 20:00:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:52,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:00:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:52,898 INFO L225 Difference]: With dead ends: 1337 [2019-12-07 20:00:52,898 INFO L226 Difference]: Without dead ends: 769 [2019-12-07 20:00:52,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:00:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-07 20:00:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 767. [2019-12-07 20:00:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-12-07 20:00:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1036 transitions. [2019-12-07 20:00:52,922 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1036 transitions. Word has length 53 [2019-12-07 20:00:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:52,922 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1036 transitions. [2019-12-07 20:00:52,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1036 transitions. [2019-12-07 20:00:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:00:52,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:52,924 INFO L410 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] [2019-12-07 20:00:53,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:53,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 818560986, now seen corresponding path program 1 times [2019-12-07 20:00:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858396487] [2019-12-07 20:00:53,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:53,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858396487] [2019-12-07 20:00:53,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736621062] [2019-12-07 20:00:53,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:53,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:00:53,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:53,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:53,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:00:53,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2019-12-07 20:00:53,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259809752] [2019-12-07 20:00:53,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:53,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:00:53,260 INFO L87 Difference]: Start difference. First operand 767 states and 1036 transitions. Second operand 3 states. [2019-12-07 20:00:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:53,322 INFO L93 Difference]: Finished difference Result 2139 states and 2876 transitions. [2019-12-07 20:00:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:53,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 20:00:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:53,328 INFO L225 Difference]: With dead ends: 2139 [2019-12-07 20:00:53,328 INFO L226 Difference]: Without dead ends: 1382 [2019-12-07 20:00:53,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:00:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-07 20:00:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1380. [2019-12-07 20:00:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-12-07 20:00:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1831 transitions. [2019-12-07 20:00:53,370 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1831 transitions. Word has length 54 [2019-12-07 20:00:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:53,370 INFO L462 AbstractCegarLoop]: Abstraction has 1380 states and 1831 transitions. [2019-12-07 20:00:53,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1831 transitions. [2019-12-07 20:00:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 20:00:53,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:53,372 INFO L410 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] [2019-12-07 20:00:53,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:53,573 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -332096680, now seen corresponding path program 1 times [2019-12-07 20:00:53,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:53,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238517130] [2019-12-07 20:00:53,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238517130] [2019-12-07 20:00:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354384374] [2019-12-07 20:00:53,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:53,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:00:53,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:53,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:53,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:53,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:00:53,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-12-07 20:00:53,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627508000] [2019-12-07 20:00:53,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:00:53,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:00:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:00:53,714 INFO L87 Difference]: Start difference. First operand 1380 states and 1831 transitions. Second operand 8 states. [2019-12-07 20:00:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:54,050 INFO L93 Difference]: Finished difference Result 3198 states and 4343 transitions. [2019-12-07 20:00:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 20:00:54,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 20:00:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:54,057 INFO L225 Difference]: With dead ends: 3198 [2019-12-07 20:00:54,057 INFO L226 Difference]: Without dead ends: 1828 [2019-12-07 20:00:54,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-12-07 20:00:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2019-12-07 20:00:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1185. [2019-12-07 20:00:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 20:00:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1611 transitions. [2019-12-07 20:00:54,098 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1611 transitions. Word has length 55 [2019-12-07 20:00:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:54,098 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1611 transitions. [2019-12-07 20:00:54,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:00:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1611 transitions. [2019-12-07 20:00:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:00:54,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:54,100 INFO L410 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] [2019-12-07 20:00:54,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:54,300 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1576068559, now seen corresponding path program 1 times [2019-12-07 20:00:54,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:54,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730693744] [2019-12-07 20:00:54,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:54,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730693744] [2019-12-07 20:00:54,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897435115] [2019-12-07 20:00:54,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:54,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:00:54,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:54,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:54,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:00:54,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 8 [2019-12-07 20:00:54,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27199714] [2019-12-07 20:00:54,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:00:54,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:00:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:00:54,434 INFO L87 Difference]: Start difference. First operand 1185 states and 1611 transitions. Second operand 5 states. [2019-12-07 20:00:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:54,498 INFO L93 Difference]: Finished difference Result 2234 states and 3033 transitions. [2019-12-07 20:00:54,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:00:54,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 20:00:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:54,505 INFO L225 Difference]: With dead ends: 2234 [2019-12-07 20:00:54,505 INFO L226 Difference]: Without dead ends: 1239 [2019-12-07 20:00:54,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:00:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-07 20:00:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1185. [2019-12-07 20:00:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 20:00:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1575 transitions. [2019-12-07 20:00:54,551 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1575 transitions. Word has length 57 [2019-12-07 20:00:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:54,552 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1575 transitions. [2019-12-07 20:00:54,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:00:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1575 transitions. [2019-12-07 20:00:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:00:54,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:54,553 INFO L410 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] [2019-12-07 20:00:54,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:54,754 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash -435716848, now seen corresponding path program 1 times [2019-12-07 20:00:54,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:54,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693844856] [2019-12-07 20:00:54,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:54,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693844856] [2019-12-07 20:00:54,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:54,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:54,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119668447] [2019-12-07 20:00:54,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:54,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:54,783 INFO L87 Difference]: Start difference. First operand 1185 states and 1575 transitions. Second operand 3 states. [2019-12-07 20:00:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:54,841 INFO L93 Difference]: Finished difference Result 2187 states and 2905 transitions. [2019-12-07 20:00:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:54,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 20:00:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:54,846 INFO L225 Difference]: With dead ends: 2187 [2019-12-07 20:00:54,847 INFO L226 Difference]: Without dead ends: 1192 [2019-12-07 20:00:54,848 INFO L630 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 [2019-12-07 20:00:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-07 20:00:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1175. [2019-12-07 20:00:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2019-12-07 20:00:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1489 transitions. [2019-12-07 20:00:54,889 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1489 transitions. Word has length 57 [2019-12-07 20:00:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:54,889 INFO L462 AbstractCegarLoop]: Abstraction has 1175 states and 1489 transitions. [2019-12-07 20:00:54,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1489 transitions. [2019-12-07 20:00:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 20:00:54,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:54,892 INFO L410 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] [2019-12-07 20:00:54,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1661764445, now seen corresponding path program 1 times [2019-12-07 20:00:54,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:54,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839002304] [2019-12-07 20:00:54,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839002304] [2019-12-07 20:00:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353249983] [2019-12-07 20:00:54,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:55,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:00:55,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:55,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:55,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:55,036 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:55,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:00:55,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [5] total 11 [2019-12-07 20:00:55,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789655245] [2019-12-07 20:00:55,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:00:55,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:00:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:00:55,059 INFO L87 Difference]: Start difference. First operand 1175 states and 1489 transitions. Second operand 9 states. [2019-12-07 20:00:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:55,488 INFO L93 Difference]: Finished difference Result 2628 states and 3355 transitions. [2019-12-07 20:00:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 20:00:55,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 20:00:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:55,496 INFO L225 Difference]: With dead ends: 2628 [2019-12-07 20:00:55,497 INFO L226 Difference]: Without dead ends: 1648 [2019-12-07 20:00:55,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2019-12-07 20:00:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-12-07 20:00:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1015. [2019-12-07 20:00:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-12-07 20:00:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1306 transitions. [2019-12-07 20:00:55,533 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1306 transitions. Word has length 58 [2019-12-07 20:00:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:55,534 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1306 transitions. [2019-12-07 20:00:55,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:00:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1306 transitions. [2019-12-07 20:00:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 20:00:55,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:55,535 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:55,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:55,736 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 828149154, now seen corresponding path program 1 times [2019-12-07 20:00:55,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:55,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032442975] [2019-12-07 20:00:55,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:55,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032442975] [2019-12-07 20:00:55,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:55,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:00:55,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289841389] [2019-12-07 20:00:55,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:00:55,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:55,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:00:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:55,765 INFO L87 Difference]: Start difference. First operand 1015 states and 1306 transitions. Second operand 4 states. [2019-12-07 20:00:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:55,826 INFO L93 Difference]: Finished difference Result 2170 states and 2801 transitions. [2019-12-07 20:00:55,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:00:55,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 20:00:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:55,830 INFO L225 Difference]: With dead ends: 2170 [2019-12-07 20:00:55,830 INFO L226 Difference]: Without dead ends: 1329 [2019-12-07 20:00:55,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-12-07 20:00:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1022. [2019-12-07 20:00:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-12-07 20:00:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1321 transitions. [2019-12-07 20:00:55,864 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1321 transitions. Word has length 59 [2019-12-07 20:00:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:55,864 INFO L462 AbstractCegarLoop]: Abstraction has 1022 states and 1321 transitions. [2019-12-07 20:00:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:00:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1321 transitions. [2019-12-07 20:00:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 20:00:55,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:55,866 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:55,866 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1005755077, now seen corresponding path program 1 times [2019-12-07 20:00:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:55,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624974806] [2019-12-07 20:00:55,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:00:55,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624974806] [2019-12-07 20:00:55,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:55,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:55,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252100293] [2019-12-07 20:00:55,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:55,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:55,884 INFO L87 Difference]: Start difference. First operand 1022 states and 1321 transitions. Second operand 3 states. [2019-12-07 20:00:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:55,944 INFO L93 Difference]: Finished difference Result 2371 states and 3084 transitions. [2019-12-07 20:00:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:55,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 20:00:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:55,949 INFO L225 Difference]: With dead ends: 2371 [2019-12-07 20:00:55,949 INFO L226 Difference]: Without dead ends: 1360 [2019-12-07 20:00:55,950 INFO L630 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 [2019-12-07 20:00:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-12-07 20:00:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1223. [2019-12-07 20:00:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 20:00:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1586 transitions. [2019-12-07 20:00:55,989 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1586 transitions. Word has length 59 [2019-12-07 20:00:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:55,989 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1586 transitions. [2019-12-07 20:00:55,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1586 transitions. [2019-12-07 20:00:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 20:00:55,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:55,991 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:55,991 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1891214234, now seen corresponding path program 1 times [2019-12-07 20:00:55,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:55,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984891188] [2019-12-07 20:00:55,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:56,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984891188] [2019-12-07 20:00:56,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:56,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:00:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872802626] [2019-12-07 20:00:56,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:56,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:56,016 INFO L87 Difference]: Start difference. First operand 1223 states and 1586 transitions. Second operand 3 states. [2019-12-07 20:00:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:56,070 INFO L93 Difference]: Finished difference Result 1791 states and 2337 transitions. [2019-12-07 20:00:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:56,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 20:00:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:56,073 INFO L225 Difference]: With dead ends: 1791 [2019-12-07 20:00:56,073 INFO L226 Difference]: Without dead ends: 813 [2019-12-07 20:00:56,074 INFO L630 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 [2019-12-07 20:00:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-12-07 20:00:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 791. [2019-12-07 20:00:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-07 20:00:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 986 transitions. [2019-12-07 20:00:56,099 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 986 transitions. Word has length 60 [2019-12-07 20:00:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:56,100 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 986 transitions. [2019-12-07 20:00:56,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 986 transitions. [2019-12-07 20:00:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 20:00:56,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:56,101 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:56,101 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1115558533, now seen corresponding path program 1 times [2019-12-07 20:00:56,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:56,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690386494] [2019-12-07 20:00:56,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:00:56,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690386494] [2019-12-07 20:00:56,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:56,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:00:56,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558516562] [2019-12-07 20:00:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:00:56,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:56,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:00:56,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:56,127 INFO L87 Difference]: Start difference. First operand 791 states and 986 transitions. Second operand 3 states. [2019-12-07 20:00:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:56,172 INFO L93 Difference]: Finished difference Result 1329 states and 1660 transitions. [2019-12-07 20:00:56,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:00:56,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 20:00:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:56,175 INFO L225 Difference]: With dead ends: 1329 [2019-12-07 20:00:56,175 INFO L226 Difference]: Without dead ends: 791 [2019-12-07 20:00:56,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:00:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-12-07 20:00:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-12-07 20:00:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-07 20:00:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 970 transitions. [2019-12-07 20:00:56,204 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 970 transitions. Word has length 60 [2019-12-07 20:00:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:56,204 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 970 transitions. [2019-12-07 20:00:56,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:00:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 970 transitions. [2019-12-07 20:00:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 20:00:56,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:56,205 INFO L410 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] [2019-12-07 20:00:56,205 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1418414809, now seen corresponding path program 1 times [2019-12-07 20:00:56,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:56,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470355941] [2019-12-07 20:00:56,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:56,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470355941] [2019-12-07 20:00:56,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531787142] [2019-12-07 20:00:56,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:56,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 20:00:56,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:00:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:56,324 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:00:56,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:00:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:56,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:00:56,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-12-07 20:00:56,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086386389] [2019-12-07 20:00:56,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:00:56,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:00:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:00:56,353 INFO L87 Difference]: Start difference. First operand 791 states and 970 transitions. Second operand 6 states. [2019-12-07 20:00:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:56,436 INFO L93 Difference]: Finished difference Result 1842 states and 2229 transitions. [2019-12-07 20:00:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:00:56,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 20:00:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:56,439 INFO L225 Difference]: With dead ends: 1842 [2019-12-07 20:00:56,439 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 20:00:56,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:00:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 20:00:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 755. [2019-12-07 20:00:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-12-07 20:00:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 887 transitions. [2019-12-07 20:00:56,464 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 887 transitions. Word has length 61 [2019-12-07 20:00:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:56,464 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 887 transitions. [2019-12-07 20:00:56,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:00:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 887 transitions. [2019-12-07 20:00:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:00:56,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:56,465 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:56,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:00:56,666 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash -695276464, now seen corresponding path program 1 times [2019-12-07 20:00:56,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:56,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353986602] [2019-12-07 20:00:56,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:00:56,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353986602] [2019-12-07 20:00:56,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:56,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:00:56,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935202774] [2019-12-07 20:00:56,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:00:56,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:00:56,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:56,803 INFO L87 Difference]: Start difference. First operand 755 states and 887 transitions. Second operand 5 states. [2019-12-07 20:00:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:56,907 INFO L93 Difference]: Finished difference Result 1797 states and 2100 transitions. [2019-12-07 20:00:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:00:56,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 20:00:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:56,911 INFO L225 Difference]: With dead ends: 1797 [2019-12-07 20:00:56,911 INFO L226 Difference]: Without dead ends: 1201 [2019-12-07 20:00:56,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-12-07 20:00:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 909. [2019-12-07 20:00:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-07 20:00:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1057 transitions. [2019-12-07 20:00:56,942 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1057 transitions. Word has length 62 [2019-12-07 20:00:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:56,943 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1057 transitions. [2019-12-07 20:00:56,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:00:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1057 transitions. [2019-12-07 20:00:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 20:00:56,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:56,944 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:56,944 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1572410586, now seen corresponding path program 1 times [2019-12-07 20:00:56,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:56,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111536190] [2019-12-07 20:00:56,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:00:57,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111536190] [2019-12-07 20:00:57,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:57,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:00:57,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55948959] [2019-12-07 20:00:57,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:00:57,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:00:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:57,008 INFO L87 Difference]: Start difference. First operand 909 states and 1057 transitions. Second operand 5 states. [2019-12-07 20:00:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:57,133 INFO L93 Difference]: Finished difference Result 2761 states and 3223 transitions. [2019-12-07 20:00:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:00:57,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-12-07 20:00:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:57,140 INFO L225 Difference]: With dead ends: 2761 [2019-12-07 20:00:57,140 INFO L226 Difference]: Without dead ends: 2246 [2019-12-07 20:00:57,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-12-07 20:00:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1372. [2019-12-07 20:00:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-12-07 20:00:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1604 transitions. [2019-12-07 20:00:57,191 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1604 transitions. Word has length 79 [2019-12-07 20:00:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:57,191 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1604 transitions. [2019-12-07 20:00:57,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:00:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1604 transitions. [2019-12-07 20:00:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 20:00:57,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:57,192 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-12-07 20:00:57,192 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1075955253, now seen corresponding path program 1 times [2019-12-07 20:00:57,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:57,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127774131] [2019-12-07 20:00:57,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:00:57,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127774131] [2019-12-07 20:00:57,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:57,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:00:57,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538913659] [2019-12-07 20:00:57,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:00:57,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:57,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:00:57,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:57,214 INFO L87 Difference]: Start difference. First operand 1372 states and 1604 transitions. Second operand 4 states. [2019-12-07 20:00:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:57,304 INFO L93 Difference]: Finished difference Result 3058 states and 3580 transitions. [2019-12-07 20:00:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:00:57,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 20:00:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:57,309 INFO L225 Difference]: With dead ends: 3058 [2019-12-07 20:00:57,310 INFO L226 Difference]: Without dead ends: 1744 [2019-12-07 20:00:57,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:00:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-12-07 20:00:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1336. [2019-12-07 20:00:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-07 20:00:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1550 transitions. [2019-12-07 20:00:57,363 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1550 transitions. Word has length 84 [2019-12-07 20:00:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:57,363 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 1550 transitions. [2019-12-07 20:00:57,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:00:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1550 transitions. [2019-12-07 20:00:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 20:00:57,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:00:57,364 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:00:57,364 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:00:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:00:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash 890157323, now seen corresponding path program 1 times [2019-12-07 20:00:57,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:00:57,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939462019] [2019-12-07 20:00:57,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:00:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:00:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:00:57,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939462019] [2019-12-07 20:00:57,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:00:57,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:00:57,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609390353] [2019-12-07 20:00:57,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:00:57,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:00:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:00:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:57,401 INFO L87 Difference]: Start difference. First operand 1336 states and 1550 transitions. Second operand 5 states. [2019-12-07 20:00:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:00:57,467 INFO L93 Difference]: Finished difference Result 1777 states and 2041 transitions. [2019-12-07 20:00:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:00:57,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-07 20:00:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:00:57,468 INFO L225 Difference]: With dead ends: 1777 [2019-12-07 20:00:57,468 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:00:57,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:00:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:00:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:00:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:00:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:00:57,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2019-12-07 20:00:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:00:57,470 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:00:57,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:00:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:00:57,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:00:57,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:00:57,823 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 184 [2019-12-07 20:00:57,994 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 214 [2019-12-07 20:00:58,342 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 312 [2019-12-07 20:00:58,629 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 293 [2019-12-07 20:00:59,358 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2019-12-07 20:00:59,566 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-12-07 20:00:59,795 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-07 20:01:00,138 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-12-07 20:01:00,631 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-07 20:01:02,925 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-07 20:01:03,404 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-12-07 20:01:04,231 WARN L192 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 62 [2019-12-07 20:01:04,444 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 20:01:06,178 WARN L192 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 197 DAG size of output: 82 [2019-12-07 20:01:06,388 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-12-07 20:01:06,691 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-12-07 20:01:06,922 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-12-07 20:01:07,031 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2019-12-07 20:01:07,185 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-07 20:01:10,687 WARN L192 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 286 DAG size of output: 82 [2019-12-07 20:01:12,411 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 261 DAG size of output: 87 [2019-12-07 20:01:12,523 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-07 20:01:13,033 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 20:01:13,397 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-07 20:01:13,881 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-12-07 20:01:14,022 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-12-07 20:01:14,025 INFO L242 CegarLoopResult]: At program point L205(lines 193 207) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-12-07 20:01:14,025 INFO L242 CegarLoopResult]: At program point L205-1(lines 193 207) the Hoare annotation is: (let ((.cse2 (= 1 ~t1_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse3 (= 1 ~t2_pc~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse6 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0))) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse4 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse5 (<= 2 ~E_2~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse5 .cse7 .cse13 .cse8 .cse9 .cse10 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse14) (and .cse11 .cse3 .cse12 .cse6 .cse13 .cse8 .cse0 .cse1 .cse4 .cse5 .cse7 .cse9 .cse10))) [2019-12-07 20:01:14,025 INFO L242 CegarLoopResult]: At program point L205-2(lines 193 207) the Hoare annotation is: (let ((.cse9 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse0 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= 1 ~t2_pc~0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= 2 ~t2_st~0) .cse1 .cse9 .cse2 .cse4 .cse10 .cse11 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse5 .cse6) (let ((.cse12 (+ ~local~0 1))) (and .cse1 .cse9 .cse2 .cse4 .cse10 (<= ~token~0 .cse12) .cse11 (<= .cse12 ~token~0) .cse5 .cse6)) (and .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse10 .cse11 .cse5 .cse6))) [2019-12-07 20:01:14,026 INFO L242 CegarLoopResult]: At program point L205-3(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2019-12-07 20:01:14,026 INFO L242 CegarLoopResult]: At program point L205-4(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse12) .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (let ((.cse15 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse15 ~token~0) (<= ~token~0 .cse15))) (and .cse6 .cse16 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse16 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,026 INFO L246 CegarLoopResult]: For program point L40(lines 40 48) no Hoare annotation was computed. [2019-12-07 20:01:14,026 INFO L242 CegarLoopResult]: At program point L205-5(lines 193 207) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,026 INFO L246 CegarLoopResult]: For program point L175(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,026 INFO L246 CegarLoopResult]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,026 INFO L246 CegarLoopResult]: For program point L175-3(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,026 INFO L246 CegarLoopResult]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-5(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-6(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-8(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-9(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-11(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-12(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-14(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-15(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L175-17(lines 175 184) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L176(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L176-1(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L176-2(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,027 INFO L246 CegarLoopResult]: For program point L176-3(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L242 CegarLoopResult]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse0 (+ ~local~0 2))) (and (= ~m_pc~0 1) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (not (= ~m_st~0 0)) (<= 2 ~t2_st~0) (<= 2 ~E_M~0) (= ~E_1~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_2~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse0 ~token~0) (<= ~token~0 .cse0))) [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L176-4(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L176-5(lines 176 181) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L242 CegarLoopResult]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse7 (= 0 ~t2_st~0))) (let ((.cse0 (<= ~m_pc~0 0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (<= 2 ~m_st~0)) (.cse13 (= 0 ~t1_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse16 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse18 (not .cse7)) (.cse22 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse17 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse19 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse20 (<= ~token~0 .cse25)) (.cse10 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse21 (<= .cse25 ~token~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse15 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse10 .cse11 .cse5 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse10 .cse5 .cse15 .cse16) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse7 .cse8) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse12 .cse15 .cse14) (and .cse0 .cse1 .cse4 .cse11 .cse5 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse10 .cse5 .cse15) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse10 .cse5 .cse15) (and .cse1 .cse17 .cse18 .cse2 .cse4 .cse20 .cse10 .cse5 .cse21 .cse6 .cse15) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse10 .cse11 .cse5 .cse13 .cse15) (and .cse0 .cse1 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14 .cse7 .cse8) (and .cse1 .cse17 .cse2 .cse4 .cse20 .cse10 .cse5 .cse21 .cse22 .cse6 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse13 .cse15 .cse7 .cse8 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (and .cse9 .cse0 .cse1 .cse18 .cse2 .cse4 .cse10 .cse5 .cse6) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse23 .cse12 .cse16 .cse14 .cse7 .cse8) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse6 .cse15) (and .cse17 .cse3 .cse10 .cse11 .cse23 .cse13 .cse9 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8) (and .cse17 .cse3 .cse11 .cse23 .cse13 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12 .cse16 .cse14) (let ((.cse24 (+ ~local~0 2))) (and .cse9 .cse1 .cse17 .cse18 .cse2 .cse4 .cse10 .cse5 .cse22 .cse6 (<= .cse24 ~token~0) (<= ~token~0 .cse24))) (and .cse1 .cse17 .cse2 .cse4 .cse19 .cse20 .cse10 .cse5 .cse21 .cse6 .cse15)))) [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-12-07 20:01:14,028 INFO L242 CegarLoopResult]: At program point L543-1(lines 368 580) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse17 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse14) .cse2 .cse15 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse14 ~token~0) .cse16 .cse12)) (and .cse17 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse16 .cse15 .cse5) (let ((.cse18 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 (<= .cse18 ~token~0) (<= ~token~0 .cse18))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse12) (and .cse7 .cse17 .cse8 (<= ~t1_pc~0 0) .cse10 .cse11 (= 0 ~t1_st~0) .cse13 (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) (and .cse17 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse5))) [2019-12-07 20:01:14,028 INFO L246 CegarLoopResult]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-12-07 20:01:14,029 INFO L242 CegarLoopResult]: At program point L281(lines 271 323) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse7 (= 0 ~t2_st~0))) (let ((.cse11 (not .cse7)) (.cse19 (<= ~token~0 .cse25)) (.cse20 (<= .cse25 ~token~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (<= 2 ~t2_st~0)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse17 (= 0 ~t1_st~0)) (.cse14 (not (= ~m_st~0 0))) (.cse8 (= 0 ~t2_pc~0)) (.cse1 (<= 2 ~E_M~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse13 .cse15 .cse5 .cse16 .cse17 .cse18) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse13 .cse19 .cse5 .cse20 .cse6 .cse14) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse13 .cse5 .cse16 .cse14 .cse18) (let ((.cse22 (+ ~local~0 2))) (and .cse9 .cse1 .cse10 .cse2 .cse4 .cse12 .cse13 .cse5 .cse21 .cse6 (<= .cse22 ~token~0) (<= ~token~0 .cse22))) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse16 .cse17 .cse18 .cse8 .cse7) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse23 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse13 .cse5 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse16 .cse23 .cse18 .cse8 .cse7) (and .cse1 .cse10 .cse2 .cse4 .cse11 .cse12 .cse19 .cse13 .cse5 .cse20 .cse6 .cse14) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse13 .cse19 .cse5 .cse20 .cse21 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse13 .cse15 .cse5 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8 .cse7) (and .cse10 .cse3 .cse13 .cse15 .cse24 .cse17 .cse9 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse12 .cse13 .cse5 .cse6) (and .cse10 .cse3 .cse15 .cse24 .cse17 .cse8 .cse7 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse17 .cse14 .cse8 .cse7) (and .cse10 .cse2 .cse3 .cse17 .cse14 .cse8 .cse7 .cse1 .cse4 .cse5 .cse16 .cse23 .cse18)))) [2019-12-07 20:01:14,029 INFO L246 CegarLoopResult]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-12-07 20:01:14,029 INFO L249 CegarLoopResult]: At program point L581(lines 528 586) the Hoare annotation is: true [2019-12-07 20:01:14,029 INFO L249 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-12-07 20:01:14,029 INFO L246 CegarLoopResult]: For program point L284(lines 284 291) no Hoare annotation was computed. [2019-12-07 20:01:14,029 INFO L242 CegarLoopResult]: At program point L186(lines 174 188) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-12-07 20:01:14,029 INFO L242 CegarLoopResult]: At program point L186-1(lines 174 188) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (<= 2 ~E_2~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse14 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse13))) [2019-12-07 20:01:14,029 INFO L242 CegarLoopResult]: At program point L186-2(lines 174 188) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (not (= 0 ~t1_st~0))) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse10 (<= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= 1 ~t2_pc~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse5 (+ ~local~0 1))) (and (<= 2 ~t2_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 (<= .cse5 ~token~0) .cse8 .cse9)) (and .cse10 .cse0 .cse2 .cse11 .cse3 .cse8 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse7 .cse8 .cse9 .cse12 .cse13) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9))) [2019-12-07 20:01:14,030 INFO L246 CegarLoopResult]: For program point L120(lines 120 128) no Hoare annotation was computed. [2019-12-07 20:01:14,030 INFO L242 CegarLoopResult]: At program point L87(lines 87 91) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0)) (.cse18 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~m_pc~0 1)) (.cse14 (<= 2 ~m_st~0)) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse15 (<= 2 ~t2_st~0)) (.cse0 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse3 (= ~E_1~0 2)) (.cse13 (= 1 ~t2_pc~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse11 (not (= 0 ~t1_st~0))) (.cse5 (<= 2 ~E_2~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse12 .cse8 .cse7) (and .cse9 .cse2 .cse13 .cse4 .cse11 .cse14 .cse15 .cse1 .cse3 .cse5 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse16 .cse17 .cse7 .cse8) (and .cse0 .cse1 .cse10 .cse3 .cse18 .cse13 .cse5 .cse6) (and .cse15 .cse1 .cse9 .cse10 .cse3 .cse18 .cse13 .cse5 .cse11 .cse16 .cse6 .cse17) (and .cse9 .cse2 .cse4 .cse11 .cse14 .cse7 .cse8 .cse1 .cse3 .cse5 .cse16 .cse12 .cse17) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse11 .cse5 .cse16 .cse17))) [2019-12-07 20:01:14,030 INFO L242 CegarLoopResult]: At program point L186-3(lines 174 188) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2019-12-07 20:01:14,030 INFO L242 CegarLoopResult]: At program point L186-4(lines 174 188) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse13 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 (<= ~token~0 .cse12) .cse8 .cse9 .cse11 .cse1 .cse4 .cse6 (<= .cse12 ~token~0) .cse7 .cse10)) (and .cse0 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9 .cse10 .cse11) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse14 ~token~0) .cse11 (<= ~token~0 .cse14))) (and .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11))) [2019-12-07 20:01:14,030 INFO L242 CegarLoopResult]: At program point L186-5(lines 174 188) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,030 INFO L246 CegarLoopResult]: For program point L156(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,030 INFO L242 CegarLoopResult]: At program point L123(lines 123 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0))) (or (and (<= ~m_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0))) (let ((.cse7 (+ ~local~0 1))) (and .cse0 (= ~m_pc~0 1) .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse7) .cse5 .cse6 (<= .cse7 ~token~0) (<= 2 ~t1_st~0))))) [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-3(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-5(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-6(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-8(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-9(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-11(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-12(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-14(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-15(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L156-17(lines 156 165) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,031 INFO L246 CegarLoopResult]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L157-4(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L242 CegarLoopResult]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse10 (<= ~m_pc~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse9 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse11 (+ ~local~0 1))) (and .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse11) .cse5 .cse6 (<= .cse11 ~token~0) .cse7 .cse8 .cse9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse8 (<= ~local~0 ~token~0) .cse9) (let ((.cse12 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse7 (<= .cse12 ~token~0) .cse9 (<= ~token~0 .cse12))))) [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-3(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L242 CegarLoopResult]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse12 (<= ~m_pc~0 0)) (.cse2 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse14 (not (= ~m_st~0 0))) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= 0 ~t2_pc~0)) (.cse17 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse0 (= ~m_pc~0 1)) (.cse3 (= ~E_1~0 2)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= 1 ~t2_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse4 (not (= 0 ~t1_st~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~m_st~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse5 .cse14 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse13 .cse15 .cse5 .cse14 .cse8) (let ((.cse16 (+ ~local~0 1))) (and .cse1 .cse0 .cse3 .cse13 (<= ~token~0 .cse16) .cse15 .cse5 (<= .cse16 ~token~0) .cse14 .cse8)) (and .cse17 .cse1 .cse12 .cse3 .cse13 .cse15 .cse5 .cse14) (and .cse17 .cse1 .cse12 .cse3 .cse13 .cse15 .cse4 .cse5) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse10 .cse11) (and .cse17 .cse1 .cse0 .cse3 .cse13 .cse15 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2) .cse5 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse14 .cse8) (and .cse1 .cse0 (= 1 ~t1_pc~0) .cse2 .cse3 .cse5 .cse14 .cse8 .cse10 .cse11) (and .cse17 .cse1 .cse0 .cse3 .cse13 .cse15 .cse5 .cse4 .cse7 .cse6 .cse9 .cse8))) [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-5(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-6(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-8(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,032 INFO L246 CegarLoopResult]: For program point L194-9(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L194-11(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L194-12(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L194-14(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L194-15(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L194-17(lines 194 203) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195-1(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195-2(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195-3(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195-4(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L246 CegarLoopResult]: For program point L195-5(lines 195 200) no Hoare annotation was computed. [2019-12-07 20:01:14,033 INFO L242 CegarLoopResult]: At program point L295(lines 271 323) the Hoare annotation is: (let ((.cse2 (<= 2 ~t2_st~0)) (.cse20 (<= 2 ~m_st~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= ~local~0 ~token~0)) (.cse0 (<= ~m_pc~0 0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse6 (<= ~t1_pc~0 0)) (.cse8 (= 0 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse3 .cse4 .cse7 .cse12 .cse9 .cse13 .cse14 .cse15) (let ((.cse17 (+ ~local~0 2))) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse12 (<= .cse17 ~token~0) (<= ~token~0 .cse17))) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse16 .cse7 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse18 .cse8 .cse19 .cse15 .cse14) (and .cse0 .cse1 .cse11 .cse4 .cse16 .cse5 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse19) (and .cse10 .cse11 .cse3 .cse8 .cse9 .cse14 .cse15 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse1 .cse10 .cse11 .cse3 .cse4 .cse7 .cse20 .cse18 .cse13 .cse19 .cse14 .cse15) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse18 .cse9 .cse19) (and .cse10 .cse3 .cse5 .cse6 .cse20 .cse8 .cse2 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse2 .cse0 .cse1 .cse11 .cse4 .cse16 .cse5 .cse7 .cse12) (and .cse2 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse12 .cse9) (and .cse10 .cse3 .cse6 .cse20 .cse8 .cse15 .cse14 .cse1 .cse4 .cse7 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse16 .cse7 .cse9 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse15 .cse14) (let ((.cse21 (+ ~local~0 1))) (and .cse1 .cse10 .cse11 .cse4 .cse16 (<= ~token~0 .cse21) .cse5 .cse7 (<= .cse21 ~token~0) .cse12 .cse9)))) [2019-12-07 20:01:14,034 INFO L242 CegarLoopResult]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (<= 2 ~m_st~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse10 (<= ~m_pc~0 0)) (.cse15 (not (= 0 ~t2_st~0))) (.cse3 (= ~E_1~0 2)) (.cse14 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse16 (<= ~t1_pc~0 0)) (.cse5 (<= 2 ~E_2~0)) (.cse12 (= 0 ~t1_st~0)) (.cse8 (not (= ~m_st~0 0)))) (or (let ((.cse7 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse6 (<= .cse7 ~token~0) (<= ~token~0 .cse7))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse1 .cse0 .cse14 .cse15 .cse3 .cse16 .cse5 .cse17 .cse11 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse11 .cse17 .cse9 .cse13) (and .cse0 .cse10 .cse15 .cse3 .cse14 .cse16 .cse5 .cse11 .cse12 .cse13) (and .cse0 .cse10 .cse15 .cse3 .cse14 .cse16 .cse5 .cse12 .cse8))) [2019-12-07 20:01:14,034 INFO L242 CegarLoopResult]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0)) (.cse5 (= 1 ~t2_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (<= ~m_pc~0 0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (= ~E_1~0 2)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= 0 ~t1_st~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (<= ~local~0 ~token~0)) (.cse16 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse13 .cse5 .cse7 .cse14 .cse10) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse7 .cse14 .cse10 .cse15 .cse16) (let ((.cse17 (+ ~local~0 2))) (and (= ~m_pc~0 1) .cse12 .cse5 .cse14 .cse10 .cse0 .cse2 .cse4 .cse13 .cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse17 ~token~0) (<= ~token~0 .cse17))) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse15))) [2019-12-07 20:01:14,034 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 20:01:14,034 INFO L242 CegarLoopResult]: At program point L562(lines 562 571) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,034 INFO L242 CegarLoopResult]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,034 INFO L246 CegarLoopResult]: For program point L298(lines 298 305) no Hoare annotation was computed. [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167(lines 155 169) the Hoare annotation is: (and (<= ~m_pc~0 0) (<= 2 ~E_M~0) (= ~E_1~0 2) (<= ~t1_pc~0 0) (<= 2 ~E_2~0) (<= ~token~0 ~local~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= 0 ~t2_st~0)) [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167-1(lines 155 169) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t1_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (<= 2 ~E_2~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse14 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse13))) [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167-2(lines 155 169) the Hoare annotation is: (let ((.cse1 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (not (= 0 ~t1_st~0))) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse10 (<= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= 1 ~t2_pc~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse5 (+ ~local~0 1))) (and (<= 2 ~t2_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 (<= .cse5 ~token~0) .cse8 .cse9)) (and .cse10 .cse0 .cse2 .cse11 .cse3 .cse8 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse7 .cse8 .cse9 .cse12 .cse13) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9))) [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167-3(lines 155 169) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse8 (<= 2 ~t1_st~0)) (.cse1 (not (= 0 ~t2_st~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~E_1~0 2)) (.cse4 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~m_st~0 0))) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (let ((.cse9 (+ ~local~0 2))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~E_M~0 1))) .cse8 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10) (and (<= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10))) [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167-4(lines 155 169) the Hoare annotation is: (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse7 (<= 2 ~t1_st~0)) (.cse12 (<= ~m_pc~0 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (= 1 ~t2_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse11) .cse5 .cse6 (<= .cse11 ~token~0) .cse7 .cse8 .cse9 .cse10)) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9 .cse10) (let ((.cse13 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse7 (<= .cse13 ~token~0) .cse10 (<= ~token~0 .cse13))) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10))) [2019-12-07 20:01:14,035 INFO L242 CegarLoopResult]: At program point L167-5(lines 155 169) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse3 (<= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse13 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse9 (<= 0 ULTIMATE.start_is_transmit2_triggered_~__retres1~2)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse8 (= ~E_1~0 2)) (.cse2 (= 1 ~t2_pc~0)) (.cse10 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) .cse11 (<= ~local~0 ~token~0)) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) .cse2 .cse13 .cse4 .cse5 .cse7 .cse8 .cse10 (<= .cse12 ~token~0) .cse14 .cse11)) (and .cse15 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse14 .cse13 .cse5) (let ((.cse16 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 (<= .cse16 ~token~0) (<= ~token~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11) (and .cse15 .cse7 .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5))) [2019-12-07 20:01:14,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:01:14 BoogieIcfgContainer [2019-12-07 20:01:14,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:01:14,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:01:14,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:01:14,102 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:01:14,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:00:51" (3/4) ... [2019-12-07 20:01:14,105 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:01:14,125 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 96 nodes and edges [2019-12-07 20:01:14,127 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-12-07 20:01:14,128 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:01:14,224 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_815d2296-e391-4e7a-9a35-60703f2fa60e/bin/utaipan/witness.graphml [2019-12-07 20:01:14,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:01:14,225 INFO L168 Benchmark]: Toolchain (without parser) took 23621.09 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Free memory was 944.8 MB in the beginning and 1.5 GB in the end (delta: -568.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:01:14,225 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:01:14,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:01:14,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:01:14,225 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:01:14,226 INFO L168 Benchmark]: RCFGBuilder took 843.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 932.4 MB in the end (delta: 154.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:01:14,226 INFO L168 Benchmark]: TraceAbstraction took 22350.79 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 932.4 MB in the beginning and 1.5 GB in the end (delta: -600.0 MB). Peak memory consumption was 514.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:01:14,226 INFO L168 Benchmark]: Witness Printer took 122.11 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:01:14,228 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 843.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 932.4 MB in the end (delta: 154.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22350.79 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 932.4 MB in the beginning and 1.5 GB in the end (delta: -600.0 MB). Peak memory consumption was 514.6 MB. Max. memory is 11.5 GB. * Witness Printer took 122.11 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_pc == 1 && 2 <= E_M) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) || ((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((2 <= E_M && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0)) || (((((((2 <= t2_st && 2 <= E_M) && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((2 <= t2_st && 2 <= E_M) && m_pc <= 0) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(0 == t1_st)) && 2 <= E_2)) || ((((((((2 <= E_M && m_pc <= 0) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && !(0 == t1_st)) && 2 <= E_2) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(0 == t1_st)) && token <= local) && 2 <= m_st) && local <= token) && __retres1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc <= 0) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && token <= local + 1) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && local <= token) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && local <= token) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && local <= token) && 0 == t2_pc) && 0 == t2_st) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st) || ((((((((((2 <= E_M && m_pc == 1) && tmp == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t1_st)) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= m_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= E_2) && token <= local) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(0 == t1_st)) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= m_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && !(m_st == 0))) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && !(0 == t1_st)) && 2 <= E_2) && token <= local) && local <= token) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0))) || ((((((2 <= E_M && m_pc <= 0) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || (((((((((((m_pc == 1 && 2 <= E_M) && tmp == 1) && !(0 == t2_st)) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 2 <= m_st) && token <= local) && 0 == t1_st) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 2 <= E_2) && token <= local) && 2 <= m_st) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && E_1 == 2) && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((2 <= E_M && m_pc <= 0) && !(0 == t2_st)) && E_1 == 2) && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && !(0 == t1_st)) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((m_pc == 1 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((((((m_pc == 1 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(0 == t2_st)) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0))) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0))) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= t2_st && 2 <= E_M) && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && tmp == 0)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && tmp == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && !(0 == t1_st)) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(0 == t1_st)) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) || ((((((((((2 <= E_M && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= t2_st && 2 <= E_M) && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || ((((((((((m_pc <= 0 && 2 <= E_M) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || (((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((((m_pc <= 0 && 2 <= E_M) && tmp == 1) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_pc) && 0 == t2_st)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && !(m_st == 0)) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || (((((((m_pc <= 0 && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0))) || ((((((((((2 <= E_M && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0))) || (((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && tmp == 1) && E_1 == 2) && 1 == t2_pc) && t1_pc <= 0) && 2 <= E_2) && 0 == t1_st) && !(m_st == 0))) || (((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((((m_pc == 1 && 1 == t1_pc) && tmp == 1) && 0 == t1_st) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st)) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && 2 <= m_st) && token <= local) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || (((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0))) || ((((((((((((m_pc == 1 && tmp == 1) && 1 == t2_pc) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && 2 <= E_2) && !(m_st == 0)) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((m_pc == 1 && tmp == 1) && t1_pc <= 0) && 2 <= m_st) && 0 == t1_st) && 0 == t2_pc) && 0 == t2_st) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0)) || ((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc) || ((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && __retres1 <= 0) && !(m_st == 0)) && __retres1 == 0)) || (((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && token <= local + 1) && 1 == t2_pc) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0)) || ((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && tmp == 1) && E_1 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && 0 == t2_pc)) || (((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && !(m_st == 0)) && __retres1 == 0) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((2 <= t2_st && 2 <= E_M) && 1 == t1_pc) && !(tmp == 0)) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && tmp == 1) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_pc) && 0 == t2_st)) || (((((((((2 <= E_M && 1 == t1_pc) && tmp == 1) && 2 <= E_2) && token <= local) && !(m_st == 0)) && __retres1 == 0) && local <= token) && 0 == t2_st) && 0 == t2_pc)) || ((((((((((((tmp == 1 && 1 == t2_pc) && t1_pc <= 0) && __retres1 <= 0) && 0 == t1_st) && !(m_st == 0)) && 2 <= t2_st) && 2 <= E_M) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && token <= local) && __retres1 == 0) && local <= token) || ((((((((((((m_pc == 1 && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= E_M) && E_1 == 2) && 2 <= E_2) && local + 1 <= token) && __retres1 == 0) && __retres1 == 0)) || (((((((((((m_pc <= 0 && 2 <= t2_st) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 0 <= __retres1) && 2 <= E_2) && __retres1 <= 0) && __retres1 == 0) && 2 <= t1_st) && tmp == 0)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && local + 2 <= token) && token <= local + 2)) || (((((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && __retres1 <= 0) && 2 <= t1_st) && !(m_st == 0)) && tmp == 0) && 2 <= t2_st) && 2 <= E_M) && E_1 == 2) && 0 <= __retres1) && 2 <= E_2) && __retres1 == 0) && __retres1 == 0)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 && 2 <= E_M) && E_1 == 2) && t1_pc <= 0) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token) && 0 == t2_pc) && 0 == t2_st - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) || (((((((((((2 <= E_M && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || ((((((((2 <= t2_st && m_pc <= 0) && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && token <= local) && local <= token) && !(m_st == 0)) && __retres1 == 0) && tmp == 0)) || (((((((((((2 <= t2_st && 2 <= E_M) && m_pc == 1) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && __retres1 == 0) && 2 <= t1_st) && local + 2 <= token) && tmp == 0) && token <= local + 2)) || ((((((((m_pc <= 0 && 2 <= E_M) && 1 == t1_pc) && E_1 == 2) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) && tmp == 0) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) || (((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2) || (((((((((m_pc == 1 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && !(m_st == 0)) && __retres1 == 0)) || ((((((((m_pc <= 0 && !(0 == t2_st)) && 1 == t1_pc) && E_1 == 2) && !(tmp == 0)) && 1 == t2_pc) && 2 <= E_2) && !(m_st == 0)) && __retres1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.5s, HoareTripleCheckerStatistics: 3375 SDtfs, 3676 SDslu, 4383 SDs, 0 SdLazy, 950 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 713 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1380occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 3656 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 397 NumberOfFragments, 6967 HoareAnnotationTreeSize, 33 FomulaSimplifications, 580280 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 33 FomulaSimplificationsInter, 186191 FormulaSimplificationTreeSizeReductionInter, 15.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 236996 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 33 InterpolantComputations, 26 PerfectInterpolantSequences, 412/429 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...