./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 949942bcd30c11cd050737185c4313ee1459089f9da346d697b721e3407e41e2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 09:59:35,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 09:59:35,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 09:59:35,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 09:59:35,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 09:59:35,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 09:59:35,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 09:59:35,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 09:59:35,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 09:59:35,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 09:59:35,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 09:59:35,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 09:59:35,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 09:59:35,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 09:59:35,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 09:59:35,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 09:59:35,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 09:59:35,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 09:59:35,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 09:59:35,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 09:59:35,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 09:59:35,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 09:59:35,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 09:59:35,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 09:59:35,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 09:59:35,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 09:59:35,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 09:59:35,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 09:59:35,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 09:59:35,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 09:59:35,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 09:59:35,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 09:59:35,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 09:59:35,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 09:59:35,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 09:59:35,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 09:59:35,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 09:59:35,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 09:59:35,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 09:59:35,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 09:59:35,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 09:59:35,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 09:59:36,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 09:59:36,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 09:59:36,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 09:59:36,032 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 09:59:36,033 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 09:59:36,033 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 09:59:36,033 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 09:59:36,034 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 09:59:36,034 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 09:59:36,034 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 09:59:36,035 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 09:59:36,036 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 09:59:36,036 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 09:59:36,036 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 09:59:36,037 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 09:59:36,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 09:59:36,038 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 09:59:36,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 09:59:36,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 09:59:36,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 09:59:36,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 09:59:36,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 09:59:36,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 09:59:36,040 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 09:59:36,040 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 09:59:36,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 09:59:36,040 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 09:59:36,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 09:59:36,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 09:59:36,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 09:59:36,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 09:59:36,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 09:59:36,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 09:59:36,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 09:59:36,044 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 09:59:36,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 09:59:36,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 09:59:36,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 09:59:36,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 09:59:36,046 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 949942bcd30c11cd050737185c4313ee1459089f9da346d697b721e3407e41e2 [2021-10-24 09:59:36,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 09:59:36,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 09:59:36,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 09:59:36,495 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 09:59:36,496 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 09:59:36,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-24 09:59:36,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/data/4a5413e4b/e3d24c2fd51c4d978f674d7683288eaa/FLAG5ee9fa69c [2021-10-24 09:59:37,184 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 09:59:37,184 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-24 09:59:37,208 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/data/4a5413e4b/e3d24c2fd51c4d978f674d7683288eaa/FLAG5ee9fa69c [2021-10-24 09:59:37,543 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/data/4a5413e4b/e3d24c2fd51c4d978f674d7683288eaa [2021-10-24 09:59:37,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 09:59:37,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 09:59:37,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 09:59:37,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 09:59:37,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 09:59:37,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:59:37" (1/1) ... [2021-10-24 09:59:37,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35209ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:37, skipping insertion in model container [2021-10-24 09:59:37,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:59:37" (1/1) ... [2021-10-24 09:59:37,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 09:59:37,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 09:59:37,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-24 09:59:37,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 09:59:37,989 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 09:59:38,002 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-24 09:59:38,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 09:59:38,060 INFO L208 MainTranslator]: Completed translation [2021-10-24 09:59:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38 WrapperNode [2021-10-24 09:59:38,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 09:59:38,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 09:59:38,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 09:59:38,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 09:59:38,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 09:59:38,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 09:59:38,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 09:59:38,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 09:59:38,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 09:59:38,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 09:59:38,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 09:59:38,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 09:59:38,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (1/1) ... [2021-10-24 09:59:38,230 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 09:59:38,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:38,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 09:59:38,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 09:59:38,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 09:59:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 09:59:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 09:59:38,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 09:59:40,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 09:59:40,341 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-10-24 09:59:40,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:59:40 BoogieIcfgContainer [2021-10-24 09:59:40,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 09:59:40,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 09:59:40,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 09:59:40,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 09:59:40,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:59:37" (1/3) ... [2021-10-24 09:59:40,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29312038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:59:40, skipping insertion in model container [2021-10-24 09:59:40,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:59:38" (2/3) ... [2021-10-24 09:59:40,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29312038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:59:40, skipping insertion in model container [2021-10-24 09:59:40,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:59:40" (3/3) ... [2021-10-24 09:59:40,355 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-10-24 09:59:40,362 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 09:59:40,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-24 09:59:40,423 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 09:59:40,430 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-24 09:59:40,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-24 09:59:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-24 09:59:40,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:40,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 09:59:40,461 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash -94103792, now seen corresponding path program 1 times [2021-10-24 09:59:40,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:40,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2448728] [2021-10-24 09:59:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:40,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:40,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:40,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2448728] [2021-10-24 09:59:40,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2448728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:40,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:40,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 09:59:40,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174282762] [2021-10-24 09:59:40,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:40,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:40,744 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:40,892 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2021-10-24 09:59:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-24 09:59:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:40,913 INFO L225 Difference]: With dead ends: 275 [2021-10-24 09:59:40,914 INFO L226 Difference]: Without dead ends: 173 [2021-10-24 09:59:40,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-24 09:59:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2021-10-24 09:59:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-10-24 09:59:40,975 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 19 [2021-10-24 09:59:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:40,976 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-10-24 09:59:40,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-10-24 09:59:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-24 09:59:40,979 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:40,980 INFO L512 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] [2021-10-24 09:59:40,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 09:59:40,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash -903760834, now seen corresponding path program 1 times [2021-10-24 09:59:40,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:40,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518811509] [2021-10-24 09:59:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:40,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-24 09:59:41,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:41,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518811509] [2021-10-24 09:59:41,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518811509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:41,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:41,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:41,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504822056] [2021-10-24 09:59:41,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:41,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:41,062 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:41,302 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-10-24 09:59:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-24 09:59:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:41,307 INFO L225 Difference]: With dead ends: 514 [2021-10-24 09:59:41,307 INFO L226 Difference]: Without dead ends: 356 [2021-10-24 09:59:41,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-24 09:59:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 279. [2021-10-24 09:59:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 278 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2021-10-24 09:59:41,341 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 36 [2021-10-24 09:59:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:41,341 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2021-10-24 09:59:41,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2021-10-24 09:59:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-24 09:59:41,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:41,345 INFO L512 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] [2021-10-24 09:59:41,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 09:59:41,346 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 15213789, now seen corresponding path program 1 times [2021-10-24 09:59:41,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:41,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854433764] [2021-10-24 09:59:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:41,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:41,484 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:41,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854433764] [2021-10-24 09:59:41,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854433764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:41,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:41,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:41,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103596418] [2021-10-24 09:59:41,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:41,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:41,490 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:41,648 INFO L93 Difference]: Finished difference Result 877 states and 1246 transitions. [2021-10-24 09:59:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-24 09:59:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:41,655 INFO L225 Difference]: With dead ends: 877 [2021-10-24 09:59:41,655 INFO L226 Difference]: Without dead ends: 606 [2021-10-24 09:59:41,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-10-24 09:59:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2021-10-24 09:59:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4057971014492754) internal successors, (679), 483 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2021-10-24 09:59:41,715 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 36 [2021-10-24 09:59:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:41,715 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2021-10-24 09:59:41,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2021-10-24 09:59:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-24 09:59:41,719 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:41,720 INFO L512 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] [2021-10-24 09:59:41,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 09:59:41,720 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1264110946, now seen corresponding path program 1 times [2021-10-24 09:59:41,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:41,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917510465] [2021-10-24 09:59:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:41,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:41,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:41,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917510465] [2021-10-24 09:59:41,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917510465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:41,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:41,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:41,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550907345] [2021-10-24 09:59:41,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:41,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:41,898 INFO L87 Difference]: Start difference. First operand 484 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:41,967 INFO L93 Difference]: Finished difference Result 844 states and 1214 transitions. [2021-10-24 09:59:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-24 09:59:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:41,973 INFO L225 Difference]: With dead ends: 844 [2021-10-24 09:59:41,973 INFO L226 Difference]: Without dead ends: 568 [2021-10-24 09:59:41,976 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-24 09:59:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 532. [2021-10-24 09:59:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 531 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 759 transitions. [2021-10-24 09:59:42,012 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 759 transitions. Word has length 36 [2021-10-24 09:59:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:42,013 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 759 transitions. [2021-10-24 09:59:42,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 759 transitions. [2021-10-24 09:59:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-24 09:59:42,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:42,021 INFO L512 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] [2021-10-24 09:59:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 09:59:42,022 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -642955608, now seen corresponding path program 1 times [2021-10-24 09:59:42,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:42,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302631210] [2021-10-24 09:59:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:42,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:42,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:42,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302631210] [2021-10-24 09:59:42,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302631210] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:42,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:42,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:42,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744084564] [2021-10-24 09:59:42,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:42,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:42,216 INFO L87 Difference]: Start difference. First operand 532 states and 759 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:42,378 INFO L93 Difference]: Finished difference Result 1793 states and 2575 transitions. [2021-10-24 09:59:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-24 09:59:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:42,388 INFO L225 Difference]: With dead ends: 1793 [2021-10-24 09:59:42,389 INFO L226 Difference]: Without dead ends: 1271 [2021-10-24 09:59:42,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-10-24 09:59:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 966. [2021-10-24 09:59:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4124352331606218) internal successors, (1363), 965 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1363 transitions. [2021-10-24 09:59:42,476 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1363 transitions. Word has length 52 [2021-10-24 09:59:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:42,477 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1363 transitions. [2021-10-24 09:59:42,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1363 transitions. [2021-10-24 09:59:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-24 09:59:42,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:42,481 INFO L512 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] [2021-10-24 09:59:42,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 09:59:42,482 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -650280792, now seen corresponding path program 1 times [2021-10-24 09:59:42,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:42,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631797059] [2021-10-24 09:59:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:42,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:42,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:42,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631797059] [2021-10-24 09:59:42,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631797059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:42,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:42,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:42,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45838023] [2021-10-24 09:59:42,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:42,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:42,577 INFO L87 Difference]: Start difference. First operand 966 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:42,798 INFO L93 Difference]: Finished difference Result 3294 states and 4654 transitions. [2021-10-24 09:59:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-10-24 09:59:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:42,817 INFO L225 Difference]: With dead ends: 3294 [2021-10-24 09:59:42,817 INFO L226 Difference]: Without dead ends: 2338 [2021-10-24 09:59:42,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-10-24 09:59:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1748. [2021-10-24 09:59:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3892386949055524) internal successors, (2427), 1747 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2427 transitions. [2021-10-24 09:59:43,018 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2427 transitions. Word has length 53 [2021-10-24 09:59:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:43,019 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2427 transitions. [2021-10-24 09:59:43,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2427 transitions. [2021-10-24 09:59:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-24 09:59:43,027 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:43,027 INFO L512 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] [2021-10-24 09:59:43,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 09:59:43,029 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 128308584, now seen corresponding path program 1 times [2021-10-24 09:59:43,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:43,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010551713] [2021-10-24 09:59:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:43,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:43,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:43,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010551713] [2021-10-24 09:59:43,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010551713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:43,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:43,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:43,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246972827] [2021-10-24 09:59:43,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:43,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:43,178 INFO L87 Difference]: Start difference. First operand 1748 states and 2427 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:43,326 INFO L93 Difference]: Finished difference Result 2978 states and 4160 transitions. [2021-10-24 09:59:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:43,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-24 09:59:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:43,343 INFO L225 Difference]: With dead ends: 2978 [2021-10-24 09:59:43,343 INFO L226 Difference]: Without dead ends: 1892 [2021-10-24 09:59:43,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2021-10-24 09:59:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1748. [2021-10-24 09:59:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3388666285060102) internal successors, (2339), 1747 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2339 transitions. [2021-10-24 09:59:43,507 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2339 transitions. Word has length 54 [2021-10-24 09:59:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:43,508 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2339 transitions. [2021-10-24 09:59:43,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2339 transitions. [2021-10-24 09:59:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-24 09:59:43,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:43,514 INFO L512 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] [2021-10-24 09:59:43,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 09:59:43,515 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1101797543, now seen corresponding path program 1 times [2021-10-24 09:59:43,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:43,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145445351] [2021-10-24 09:59:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:43,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:43,643 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:43,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145445351] [2021-10-24 09:59:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145445351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:43,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:43,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:59:43,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150748543] [2021-10-24 09:59:43,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:59:43,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:59:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:43,647 INFO L87 Difference]: Start difference. First operand 1748 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:43,880 INFO L93 Difference]: Finished difference Result 3234 states and 4351 transitions. [2021-10-24 09:59:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 09:59:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-24 09:59:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:43,895 INFO L225 Difference]: With dead ends: 3234 [2021-10-24 09:59:43,895 INFO L226 Difference]: Without dead ends: 1496 [2021-10-24 09:59:43,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-24 09:59:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-10-24 09:59:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1333. [2021-10-24 09:59:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.3543543543543544) internal successors, (1804), 1332 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2021-10-24 09:59:44,013 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 54 [2021-10-24 09:59:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:44,013 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2021-10-24 09:59:44,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2021-10-24 09:59:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-24 09:59:44,017 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:44,018 INFO L512 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] [2021-10-24 09:59:44,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 09:59:44,018 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -711580186, now seen corresponding path program 1 times [2021-10-24 09:59:44,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:44,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790290919] [2021-10-24 09:59:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:44,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:44,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:44,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790290919] [2021-10-24 09:59:44,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790290919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:44,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:44,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:59:44,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356079715] [2021-10-24 09:59:44,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:59:44,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:59:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:44,087 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:44,285 INFO L93 Difference]: Finished difference Result 2602 states and 3527 transitions. [2021-10-24 09:59:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 09:59:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-10-24 09:59:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:44,296 INFO L225 Difference]: With dead ends: 2602 [2021-10-24 09:59:44,296 INFO L226 Difference]: Without dead ends: 1280 [2021-10-24 09:59:44,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-24 09:59:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-10-24 09:59:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1125. [2021-10-24 09:59:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3665480427046264) internal successors, (1536), 1124 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1536 transitions. [2021-10-24 09:59:44,407 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1536 transitions. Word has length 56 [2021-10-24 09:59:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:44,408 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1536 transitions. [2021-10-24 09:59:44,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1536 transitions. [2021-10-24 09:59:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-24 09:59:44,411 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:44,412 INFO L512 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] [2021-10-24 09:59:44,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 09:59:44,412 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301811, now seen corresponding path program 1 times [2021-10-24 09:59:44,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:44,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651512650] [2021-10-24 09:59:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:44,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:44,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:44,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651512650] [2021-10-24 09:59:44,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651512650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:44,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:44,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:59:44,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271104021] [2021-10-24 09:59:44,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:59:44,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:59:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:44,492 INFO L87 Difference]: Start difference. First operand 1125 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:44,703 INFO L93 Difference]: Finished difference Result 2435 states and 3301 transitions. [2021-10-24 09:59:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 09:59:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-24 09:59:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:44,713 INFO L225 Difference]: With dead ends: 2435 [2021-10-24 09:59:44,714 INFO L226 Difference]: Without dead ends: 1321 [2021-10-24 09:59:44,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-24 09:59:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-10-24 09:59:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1125. [2021-10-24 09:59:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3487544483985765) internal successors, (1516), 1124 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1516 transitions. [2021-10-24 09:59:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1516 transitions. Word has length 58 [2021-10-24 09:59:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:44,803 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1516 transitions. [2021-10-24 09:59:44,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1516 transitions. [2021-10-24 09:59:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-24 09:59:44,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:44,808 INFO L512 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] [2021-10-24 09:59:44,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 09:59:44,808 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1326313774, now seen corresponding path program 1 times [2021-10-24 09:59:44,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:44,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425328282] [2021-10-24 09:59:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:44,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:44,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:44,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425328282] [2021-10-24 09:59:44,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425328282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:44,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:44,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:44,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089729241] [2021-10-24 09:59:44,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:44,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:44,899 INFO L87 Difference]: Start difference. First operand 1125 states and 1516 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:45,002 INFO L93 Difference]: Finished difference Result 1915 states and 2588 transitions. [2021-10-24 09:59:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:45,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-24 09:59:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:45,010 INFO L225 Difference]: With dead ends: 1915 [2021-10-24 09:59:45,010 INFO L226 Difference]: Without dead ends: 801 [2021-10-24 09:59:45,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-10-24 09:59:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 786. [2021-10-24 09:59:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2955414012738853) internal successors, (1017), 785 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1017 transitions. [2021-10-24 09:59:45,088 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1017 transitions. Word has length 58 [2021-10-24 09:59:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:45,089 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1017 transitions. [2021-10-24 09:59:45,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1017 transitions. [2021-10-24 09:59:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-24 09:59:45,094 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:45,094 INFO L512 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] [2021-10-24 09:59:45,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 09:59:45,095 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:45,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash -906808733, now seen corresponding path program 1 times [2021-10-24 09:59:45,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:45,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832292492] [2021-10-24 09:59:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:45,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:45,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:45,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832292492] [2021-10-24 09:59:45,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832292492] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:59:45,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777935865] [2021-10-24 09:59:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:45,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:45,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:59:45,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 09:59:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:45,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-24 09:59:45,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:59:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:45,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:59:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:46,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777935865] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:46,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 09:59:46,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [8] total 12 [2021-10-24 09:59:46,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695940166] [2021-10-24 09:59:46,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 09:59:46,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:46,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 09:59:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-24 09:59:46,331 INFO L87 Difference]: Start difference. First operand 786 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:46,442 INFO L93 Difference]: Finished difference Result 1544 states and 2000 transitions. [2021-10-24 09:59:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 09:59:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-24 09:59:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:46,448 INFO L225 Difference]: With dead ends: 1544 [2021-10-24 09:59:46,448 INFO L226 Difference]: Without dead ends: 790 [2021-10-24 09:59:46,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 98.8ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-24 09:59:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-10-24 09:59:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 786. [2021-10-24 09:59:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2751592356687897) internal successors, (1001), 785 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1001 transitions. [2021-10-24 09:59:46,512 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1001 transitions. Word has length 59 [2021-10-24 09:59:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:46,513 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1001 transitions. [2021-10-24 09:59:46,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1001 transitions. [2021-10-24 09:59:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-24 09:59:46,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:46,516 INFO L512 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] [2021-10-24 09:59:46,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 09:59:46,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:46,740 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1977232412, now seen corresponding path program 1 times [2021-10-24 09:59:46,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:46,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915633056] [2021-10-24 09:59:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:46,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:46,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:46,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915633056] [2021-10-24 09:59:46,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915633056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:46,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:46,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:46,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880657530] [2021-10-24 09:59:46,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:46,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:46,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:46,799 INFO L87 Difference]: Start difference. First operand 786 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:46,875 INFO L93 Difference]: Finished difference Result 1384 states and 1770 transitions. [2021-10-24 09:59:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:46,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-24 09:59:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:46,881 INFO L225 Difference]: With dead ends: 1384 [2021-10-24 09:59:46,881 INFO L226 Difference]: Without dead ends: 630 [2021-10-24 09:59:46,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-10-24 09:59:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 617. [2021-10-24 09:59:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.228896103896104) internal successors, (757), 616 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 757 transitions. [2021-10-24 09:59:46,928 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 757 transitions. Word has length 59 [2021-10-24 09:59:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:46,929 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 757 transitions. [2021-10-24 09:59:46,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 757 transitions. [2021-10-24 09:59:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-24 09:59:46,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:46,932 INFO L512 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] [2021-10-24 09:59:46,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-24 09:59:46,932 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1340286050, now seen corresponding path program 1 times [2021-10-24 09:59:46,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:46,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397781398] [2021-10-24 09:59:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:46,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:47,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:47,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397781398] [2021-10-24 09:59:47,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397781398] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:59:47,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365221304] [2021-10-24 09:59:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:47,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:47,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:47,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:59:47,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 09:59:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:47,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 09:59:47,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:59:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:47,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:59:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:48,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365221304] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:48,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 09:59:48,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [8] total 13 [2021-10-24 09:59:48,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123929233] [2021-10-24 09:59:48,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-24 09:59:48,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-24 09:59:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-24 09:59:48,442 INFO L87 Difference]: Start difference. First operand 617 states and 757 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:48,811 INFO L93 Difference]: Finished difference Result 2176 states and 2676 transitions. [2021-10-24 09:59:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 09:59:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-24 09:59:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:48,824 INFO L225 Difference]: With dead ends: 2176 [2021-10-24 09:59:48,825 INFO L226 Difference]: Without dead ends: 1710 [2021-10-24 09:59:48,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 170.2ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-24 09:59:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-24 09:59:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1000. [2021-10-24 09:59:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 1.2392392392392393) internal successors, (1238), 999 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1238 transitions. [2021-10-24 09:59:48,932 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1238 transitions. Word has length 60 [2021-10-24 09:59:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:48,932 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1238 transitions. [2021-10-24 09:59:48,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1238 transitions. [2021-10-24 09:59:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-24 09:59:48,936 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:48,936 INFO L512 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, 1] [2021-10-24 09:59:48,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 09:59:49,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-24 09:59:49,160 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash -630394364, now seen corresponding path program 1 times [2021-10-24 09:59:49,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:49,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495240818] [2021-10-24 09:59:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:49,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:49,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:49,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495240818] [2021-10-24 09:59:49,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495240818] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:59:49,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219907414] [2021-10-24 09:59:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:49,382 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:49,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:59:49,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 09:59:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:49,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 09:59:49,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:59:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:50,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:59:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:50,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219907414] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:50,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 09:59:50,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 09:59:50,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014834145] [2021-10-24 09:59:50,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:50,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 09:59:50,394 INFO L87 Difference]: Start difference. First operand 1000 states and 1238 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:50,652 INFO L93 Difference]: Finished difference Result 1701 states and 2103 transitions. [2021-10-24 09:59:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-24 09:59:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:50,676 INFO L225 Difference]: With dead ends: 1701 [2021-10-24 09:59:50,677 INFO L226 Difference]: Without dead ends: 1040 [2021-10-24 09:59:50,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 09:59:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-10-24 09:59:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 942. [2021-10-24 09:59:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.234856535600425) internal successors, (1162), 941 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1162 transitions. [2021-10-24 09:59:50,954 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1162 transitions. Word has length 60 [2021-10-24 09:59:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:50,955 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1162 transitions. [2021-10-24 09:59:50,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1162 transitions. [2021-10-24 09:59:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-24 09:59:50,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:50,959 INFO L512 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, 1] [2021-10-24 09:59:51,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 09:59:51,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-24 09:59:51,175 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash 799905747, now seen corresponding path program 1 times [2021-10-24 09:59:51,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:51,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583548227] [2021-10-24 09:59:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:51,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:51,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:51,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583548227] [2021-10-24 09:59:51,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583548227] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:59:51,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905922284] [2021-10-24 09:59:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:51,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:51,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:51,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:59:51,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 09:59:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:51,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 09:59:51,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:59:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:52,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:59:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:52,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905922284] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:52,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 09:59:52,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 09:59:52,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816935896] [2021-10-24 09:59:52,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:52,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 09:59:52,299 INFO L87 Difference]: Start difference. First operand 942 states and 1162 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:52,557 INFO L93 Difference]: Finished difference Result 1668 states and 2049 transitions. [2021-10-24 09:59:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-24 09:59:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:52,565 INFO L225 Difference]: With dead ends: 1668 [2021-10-24 09:59:52,566 INFO L226 Difference]: Without dead ends: 1109 [2021-10-24 09:59:52,567 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 09:59:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-10-24 09:59:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 943. [2021-10-24 09:59:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.2388535031847134) internal successors, (1167), 942 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1167 transitions. [2021-10-24 09:59:52,785 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1167 transitions. Word has length 60 [2021-10-24 09:59:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:52,786 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1167 transitions. [2021-10-24 09:59:52,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1167 transitions. [2021-10-24 09:59:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-24 09:59:52,789 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:52,789 INFO L512 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, 1] [2021-10-24 09:59:52,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 09:59:53,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:53,008 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1422165127, now seen corresponding path program 1 times [2021-10-24 09:59:53,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:53,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276057446] [2021-10-24 09:59:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:53,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 09:59:53,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:53,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276057446] [2021-10-24 09:59:53,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276057446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:53,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:53,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 09:59:53,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090665990] [2021-10-24 09:59:53,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 09:59:53,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 09:59:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:53,114 INFO L87 Difference]: Start difference. First operand 943 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:53,387 INFO L93 Difference]: Finished difference Result 2143 states and 2688 transitions. [2021-10-24 09:59:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 09:59:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-24 09:59:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:53,415 INFO L225 Difference]: With dead ends: 2143 [2021-10-24 09:59:53,415 INFO L226 Difference]: Without dead ends: 1211 [2021-10-24 09:59:53,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 09:59:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-10-24 09:59:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1063. [2021-10-24 09:59:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2448210922787193) internal successors, (1322), 1062 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1322 transitions. [2021-10-24 09:59:53,644 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1322 transitions. Word has length 60 [2021-10-24 09:59:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:53,644 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1322 transitions. [2021-10-24 09:59:53,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1322 transitions. [2021-10-24 09:59:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-24 09:59:53,650 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:53,650 INFO L512 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] [2021-10-24 09:59:53,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-24 09:59:53,651 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash 510128812, now seen corresponding path program 1 times [2021-10-24 09:59:53,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:53,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578995234] [2021-10-24 09:59:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:53,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 09:59:53,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:53,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578995234] [2021-10-24 09:59:53,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578995234] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 09:59:53,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983087239] [2021-10-24 09:59:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:53,787 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 09:59:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 09:59:53,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 09:59:53,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-24 09:59:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:54,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-24 09:59:54,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 09:59:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-24 09:59:54,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 09:59:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-24 09:59:54,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983087239] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:54,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 09:59:54,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-24 09:59:54,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468844100] [2021-10-24 09:59:54,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:54,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:54,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:54,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 09:59:54,891 INFO L87 Difference]: Start difference. First operand 1063 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:55,037 INFO L93 Difference]: Finished difference Result 1525 states and 1892 transitions. [2021-10-24 09:59:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:55,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-24 09:59:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:55,045 INFO L225 Difference]: With dead ends: 1525 [2021-10-24 09:59:55,045 INFO L226 Difference]: Without dead ends: 1089 [2021-10-24 09:59:55,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 09:59:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-10-24 09:59:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 708. [2021-10-24 09:59:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.2347949080622347) internal successors, (873), 707 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 873 transitions. [2021-10-24 09:59:55,131 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 873 transitions. Word has length 61 [2021-10-24 09:59:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:55,131 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 873 transitions. [2021-10-24 09:59:55,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 873 transitions. [2021-10-24 09:59:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-24 09:59:55,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:55,134 INFO L512 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] [2021-10-24 09:59:55,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-24 09:59:55,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-24 09:59:55,356 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1779942747, now seen corresponding path program 1 times [2021-10-24 09:59:55,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:55,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317108505] [2021-10-24 09:59:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:55,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-24 09:59:55,456 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:55,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317108505] [2021-10-24 09:59:55,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317108505] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:55,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:55,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 09:59:55,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829111961] [2021-10-24 09:59:55,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 09:59:55,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 09:59:55,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-24 09:59:55,460 INFO L87 Difference]: Start difference. First operand 708 states and 873 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:55,695 INFO L93 Difference]: Finished difference Result 1350 states and 1635 transitions. [2021-10-24 09:59:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-24 09:59:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-24 09:59:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:55,700 INFO L225 Difference]: With dead ends: 1350 [2021-10-24 09:59:55,700 INFO L226 Difference]: Without dead ends: 577 [2021-10-24 09:59:55,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-24 09:59:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-10-24 09:59:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 464. [2021-10-24 09:59:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.1771058315334773) internal successors, (545), 463 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 545 transitions. [2021-10-24 09:59:55,760 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 545 transitions. Word has length 61 [2021-10-24 09:59:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:55,761 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 545 transitions. [2021-10-24 09:59:55,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 545 transitions. [2021-10-24 09:59:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-24 09:59:55,763 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:55,763 INFO L512 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] [2021-10-24 09:59:55,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-24 09:59:55,764 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash -984781663, now seen corresponding path program 1 times [2021-10-24 09:59:55,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:55,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872216807] [2021-10-24 09:59:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:55,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 09:59:55,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:55,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872216807] [2021-10-24 09:59:55,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872216807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:55,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:55,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 09:59:55,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207012320] [2021-10-24 09:59:55,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:55,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:55,849 INFO L87 Difference]: Start difference. First operand 464 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:55,968 INFO L93 Difference]: Finished difference Result 840 states and 974 transitions. [2021-10-24 09:59:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-24 09:59:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:55,972 INFO L225 Difference]: With dead ends: 840 [2021-10-24 09:59:55,972 INFO L226 Difference]: Without dead ends: 507 [2021-10-24 09:59:55,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-24 09:59:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 448. [2021-10-24 09:59:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.1565995525727069) internal successors, (517), 447 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 517 transitions. [2021-10-24 09:59:56,027 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 517 transitions. Word has length 62 [2021-10-24 09:59:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:56,028 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 517 transitions. [2021-10-24 09:59:56,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 517 transitions. [2021-10-24 09:59:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-24 09:59:56,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:56,030 INFO L512 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] [2021-10-24 09:59:56,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-24 09:59:56,030 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1150400836, now seen corresponding path program 1 times [2021-10-24 09:59:56,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:56,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292155639] [2021-10-24 09:59:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:56,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 09:59:56,162 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:56,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292155639] [2021-10-24 09:59:56,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292155639] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:56,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:56,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:59:56,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915288270] [2021-10-24 09:59:56,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:59:56,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:59:56,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:56,166 INFO L87 Difference]: Start difference. First operand 448 states and 517 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:56,342 INFO L93 Difference]: Finished difference Result 1300 states and 1491 transitions. [2021-10-24 09:59:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 09:59:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-24 09:59:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:56,350 INFO L225 Difference]: With dead ends: 1300 [2021-10-24 09:59:56,350 INFO L226 Difference]: Without dead ends: 1007 [2021-10-24 09:59:56,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-10-24 09:59:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2021-10-24 09:59:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.1617076326002587) internal successors, (898), 773 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 898 transitions. [2021-10-24 09:59:56,495 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 898 transitions. Word has length 79 [2021-10-24 09:59:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:56,496 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 898 transitions. [2021-10-24 09:59:56,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 898 transitions. [2021-10-24 09:59:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-24 09:59:56,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:56,503 INFO L512 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] [2021-10-24 09:59:56,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-24 09:59:56,504 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1659025345, now seen corresponding path program 1 times [2021-10-24 09:59:56,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:56,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511985395] [2021-10-24 09:59:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:56,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-24 09:59:56,605 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:56,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511985395] [2021-10-24 09:59:56,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511985395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:56,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:56,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 09:59:56,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844294757] [2021-10-24 09:59:56,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 09:59:56,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 09:59:56,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 09:59:56,611 INFO L87 Difference]: Start difference. First operand 774 states and 898 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:56,808 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2021-10-24 09:59:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 09:59:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-24 09:59:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:56,814 INFO L225 Difference]: With dead ends: 1169 [2021-10-24 09:59:56,814 INFO L226 Difference]: Without dead ends: 567 [2021-10-24 09:59:56,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-24 09:59:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-10-24 09:59:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 531. [2021-10-24 09:59:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.1566037735849057) internal successors, (613), 530 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 613 transitions. [2021-10-24 09:59:56,885 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 613 transitions. Word has length 100 [2021-10-24 09:59:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:56,886 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 613 transitions. [2021-10-24 09:59:56,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 613 transitions. [2021-10-24 09:59:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-24 09:59:56,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 09:59:56,889 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2021-10-24 09:59:56,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-24 09:59:56,889 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 09:59:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 09:59:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash -31532579, now seen corresponding path program 1 times [2021-10-24 09:59:56,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 09:59:56,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676751749] [2021-10-24 09:59:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 09:59:56,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 09:59:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 09:59:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-24 09:59:56,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 09:59:56,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676751749] [2021-10-24 09:59:56,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676751749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 09:59:56,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 09:59:56,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 09:59:56,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28499100] [2021-10-24 09:59:56,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 09:59:56,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 09:59:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 09:59:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:56,977 INFO L87 Difference]: Start difference. First operand 531 states and 613 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 09:59:57,112 INFO L93 Difference]: Finished difference Result 774 states and 882 transitions. [2021-10-24 09:59:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 09:59:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-24 09:59:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 09:59:57,114 INFO L225 Difference]: With dead ends: 774 [2021-10-24 09:59:57,114 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 09:59:57,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 09:59:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 09:59:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 09:59:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 09:59:57,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-10-24 09:59:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 09:59:57,117 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 09:59:57,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 09:59:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 09:59:57,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 09:59:57,121 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 09:59:57,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-24 09:59:57,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-24 09:59:57,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:57,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:58,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 09:59:59,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:00:09,041 INFO L853 garLoopResultBuilder]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,041 INFO L853 garLoopResultBuilder]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,041 INFO L857 garLoopResultBuilder]: For program point L300(lines 300 307) no Hoare annotation was computed. [2021-10-24 10:00:09,041 INFO L853 garLoopResultBuilder]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-24 10:00:09,041 INFO L853 garLoopResultBuilder]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse14)) (.cse1 (= ~t1_st~0 0)) (.cse12 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse13)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse12 .cse15 .cse13 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-10-24 10:00:09,042 INFO L853 garLoopResultBuilder]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-24 10:00:09,042 INFO L853 garLoopResultBuilder]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse9 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse10 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-24 10:00:09,043 INFO L853 garLoopResultBuilder]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-24 10:00:09,043 INFO L853 garLoopResultBuilder]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,043 INFO L853 garLoopResultBuilder]: At program point L207(lines 195 209) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-24 10:00:09,043 INFO L853 garLoopResultBuilder]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse15 (= ~t2_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (= 2 ~t2_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse15)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2021-10-24 10:00:09,044 INFO L853 garLoopResultBuilder]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= .cse12 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_st~0) (not .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse8 .cse4 .cse6 (= ~m_pc~0 0) .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 (not .cse11) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2021-10-24 10:00:09,044 INFO L853 garLoopResultBuilder]: At program point L207-3(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-10-24 10:00:09,044 INFO L853 garLoopResultBuilder]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,044 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-10-24 10:00:09,044 INFO L853 garLoopResultBuilder]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,045 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,045 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,045 INFO L857 garLoopResultBuilder]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,045 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-24 10:00:09,045 INFO L857 garLoopResultBuilder]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,046 INFO L857 garLoopResultBuilder]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,047 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,048 INFO L853 garLoopResultBuilder]: At program point L46(lines 41 80) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2)) [2021-10-24 10:00:09,048 INFO L857 garLoopResultBuilder]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,048 INFO L857 garLoopResultBuilder]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2021-10-24 10:00:09,049 INFO L853 garLoopResultBuilder]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse2 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (not .cse0)) (.cse7 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse22)) (.cse12 (<= .cse22 ~token~0)) (.cse16 (= ~t1_st~0 0)) (.cse15 (= 2 ~t2_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ~m_pc~0 1)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse24 (= ~m_st~0 ~E_1~0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (not .cse2)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse8) (and .cse15 .cse16 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse8) (and .cse0 .cse21 .cse15 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse21 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse2 .cse11 .cse3 (< .cse22 ~token~0) .cse6 .cse8) (and .cse15 .cse19 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse10 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse19 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse10 .cse11 .cse23 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse23 .cse12 .cse3 .cse4 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse16 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse15 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse8) (and .cse0 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8)))) [2021-10-24 10:00:09,049 INFO L857 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-10-24 10:00:09,049 INFO L857 garLoopResultBuilder]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2021-10-24 10:00:09,049 INFO L857 garLoopResultBuilder]: For program point L577(lines 577 581) no Hoare annotation was computed. [2021-10-24 10:00:09,049 INFO L853 garLoopResultBuilder]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse13 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (not .cse0) (= ~t1_st~0 0) .cse5 .cse13 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (not .cse2) .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse10) (and .cse0 .cse12 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11))) [2021-10-24 10:00:09,050 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 321) no Hoare annotation was computed. [2021-10-24 10:00:09,050 INFO L853 garLoopResultBuilder]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-24 10:00:09,050 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-24 10:00:09,050 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-10-24 10:00:09,050 INFO L860 garLoopResultBuilder]: At program point L583(lines 530 588) the Hoare annotation is: true [2021-10-24 10:00:09,051 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 293) no Hoare annotation was computed. [2021-10-24 10:00:09,051 INFO L853 garLoopResultBuilder]: At program point L188(lines 176 190) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-24 10:00:09,051 INFO L853 garLoopResultBuilder]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse4 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse1 (= 2 ~t2_st~0)) (.cse16 (= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse14 (not .cse4)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (and .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12)))) [2021-10-24 10:00:09,051 INFO L853 garLoopResultBuilder]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-24 10:00:09,052 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2021-10-24 10:00:09,052 INFO L853 garLoopResultBuilder]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse15 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= 2 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse10 (not .cse0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (< 0 ~t1_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse11 (= 0 ~t2_st~0)) (.cse14 (not .cse1)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse16 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse15 .cse2 .cse3 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse16 .cse10 .cse1 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse8 .cse9)))) [2021-10-24 10:00:09,052 INFO L853 garLoopResultBuilder]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse11 (= ~m_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 (<= ~token~0 (+ 2 ~local~0)) .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse11 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8))) [2021-10-24 10:00:09,052 INFO L853 garLoopResultBuilder]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-24 10:00:09,053 INFO L853 garLoopResultBuilder]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-24 10:00:09,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-24 10:00:09,053 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,053 INFO L853 garLoopResultBuilder]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse19 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse5 (= ~m_st~0 ~E_1~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse17 (<= ~token~0 .cse20)) (.cse16 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse18 (<= .cse20 ~token~0)) (.cse12 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse1 (< 0 ~t2_st~0)) (.cse4 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse9 (not .cse19)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse16 .cse1 .cse2 .cse3 .cse18 .cse4 .cse15 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse14 .cse6 .cse10 .cse11) (and .cse0 .cse17 .cse16 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse19 .cse2 .cse18 .cse4 .cse15 .cse6 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11)))) [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,054 INFO L857 garLoopResultBuilder]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2021-10-24 10:00:09,055 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,056 INFO L857 garLoopResultBuilder]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,056 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,056 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,056 INFO L857 garLoopResultBuilder]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,056 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-24 10:00:09,057 INFO L853 garLoopResultBuilder]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7))) [2021-10-24 10:00:09,057 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,057 INFO L857 garLoopResultBuilder]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,057 INFO L857 garLoopResultBuilder]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,058 INFO L853 garLoopResultBuilder]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse0 (= ~t2_pc~0 1))) (let ((.cse19 (+ ~local~0 1)) (.cse3 (< 0 ~t1_st~0)) (.cse17 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not .cse0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2))) (let ((.cse8 (or (and .cse17 .cse12 .cse1 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse17 .cse12 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7))) (.cse9 (<= ~token~0 .cse19)) (.cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (<= .cse19 ~token~0)) (.cse11 (= 0 ~t2_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse11 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse15 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse13 .cse14 .cse15 .cse6 .cse7) (and (or (and .cse16 .cse0 .cse17 .cse12 .cse1 .cse2 .cse5 .cse6 .cse7 .cse18) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7)) .cse13 .cse14) (and .cse9 (not .cse18) .cse0 .cse17 .cse12 .cse10 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse16 .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7))))) [2021-10-24 10:00:09,058 INFO L857 garLoopResultBuilder]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,058 INFO L857 garLoopResultBuilder]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,058 INFO L857 garLoopResultBuilder]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,058 INFO L857 garLoopResultBuilder]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,058 INFO L857 garLoopResultBuilder]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,059 INFO L857 garLoopResultBuilder]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,059 INFO L857 garLoopResultBuilder]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,059 INFO L857 garLoopResultBuilder]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,059 INFO L857 garLoopResultBuilder]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2021-10-24 10:00:09,059 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,060 INFO L857 garLoopResultBuilder]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,060 INFO L857 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,060 INFO L857 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,060 INFO L857 garLoopResultBuilder]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,060 INFO L857 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-10-24 10:00:09,061 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-24 10:00:09,061 INFO L853 garLoopResultBuilder]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-24 10:00:09,062 INFO L853 garLoopResultBuilder]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse0)) (.cse11 (= ~t1_st~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= 2 ~t1_st~0)) (.cse12 (< 0 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse16 (+ ~local~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse13 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse8 .cse9) (and (or (and .cse11 .cse12 .cse3 .cse4 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse8 .cse9) (and .cse11 (= ~t2_pc~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse14 .cse15) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse5 (< .cse16 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 (<= 2 ~t1_st~0) .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 (<= ~token~0 .cse16) .cse2 .cse12 .cse3 .cse4 (<= .cse16 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9)))) [2021-10-24 10:00:09,062 INFO L853 garLoopResultBuilder]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse3 (= ~t2_pc~0 1))) (let ((.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse3)) (.cse2 (= 2 ~t1_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse14 (not .cse0)) (.cse15 (= ~t1_st~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse1 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse14 .cse15 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8) (and .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8)))) [2021-10-24 10:00:09,068 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:00:09,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:00:09 BoogieIcfgContainer [2021-10-24 10:00:09,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:00:09,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:00:09,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:00:09,168 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:00:09,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:59:40" (3/4) ... [2021-10-24 10:00:09,172 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 10:00:09,199 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-10-24 10:00:09,201 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-24 10:00:09,204 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-24 10:00:09,206 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-24 10:00:09,352 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:00:09,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:00:09,354 INFO L168 Benchmark]: Toolchain (without parser) took 31805.04 ms. Allocated memory was 94.4 MB in the beginning and 287.3 MB in the end (delta: 192.9 MB). Free memory was 51.8 MB in the beginning and 90.3 MB in the end (delta: -38.5 MB). Peak memory consumption was 154.3 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,354 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 94.4 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:00:09,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.12 ms. Allocated memory is still 94.4 MB. Free memory was 72.4 MB in the beginning and 66.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 63.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,356 INFO L168 Benchmark]: Boogie Preprocessor took 62.76 ms. Allocated memory is still 94.4 MB. Free memory was 63.3 MB in the beginning and 60.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,356 INFO L168 Benchmark]: RCFGBuilder took 2146.10 ms. Allocated memory was 94.4 MB in the beginning and 123.7 MB in the end (delta: 29.4 MB). Free memory was 60.7 MB in the beginning and 53.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,357 INFO L168 Benchmark]: TraceAbstraction took 28819.65 ms. Allocated memory was 123.7 MB in the beginning and 287.3 MB in the end (delta: 163.6 MB). Free memory was 53.4 MB in the beginning and 106.0 MB in the end (delta: -52.6 MB). Peak memory consumption was 135.9 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,357 INFO L168 Benchmark]: Witness Printer took 185.00 ms. Allocated memory is still 287.3 MB. Free memory was 106.0 MB in the beginning and 90.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-24 10:00:09,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 94.4 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 489.12 ms. Allocated memory is still 94.4 MB. Free memory was 72.4 MB in the beginning and 66.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 94.4 MB. Free memory was 66.5 MB in the beginning and 63.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.76 ms. Allocated memory is still 94.4 MB. Free memory was 63.3 MB in the beginning and 60.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2146.10 ms. Allocated memory was 94.4 MB in the beginning and 123.7 MB in the end (delta: 29.4 MB). Free memory was 60.7 MB in the beginning and 53.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28819.65 ms. Allocated memory was 123.7 MB in the beginning and 287.3 MB in the end (delta: 163.6 MB). Free memory was 53.4 MB in the beginning and 106.0 MB in the end (delta: -52.6 MB). Peak memory consumption was 135.9 MB. Max. memory is 16.1 GB. * Witness Printer took 185.00 ms. Allocated memory is still 287.3 MB. Free memory was 106.0 MB in the beginning and 90.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28647.0ms, OverallIterations: 23, TraceHistogramMax: 4, EmptinessCheckTime: 87.8ms, AutomataDifference: 4613.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 11917.8ms, InitialAbstractionConstructionTime: 15.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3520 SDtfs, 4838 SDslu, 4429 SDs, 0 SdLazy, 930 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1186.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 623.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1748occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2299.6ms AutomataMinimizationTime, 23 MinimizatonAttempts, 3774 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 288 NumberOfFragments, 6220 HoareAnnotationTreeSize, 33 FomulaSimplifications, 179031 FormulaSimplificationTreeSizeReduction, 2770.9ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 47486 FormulaSimplificationTreeSizeReductionInter, 9122.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 243.4ms SsaConstructionTime, 948.7ms SatisfiabilityAnalysisTime, 5489.1ms InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 482/493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || ((((((((((((__retres1 == 0 && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || (((((((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_st == 0 && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) || ((((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((t2_pc == 1 && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && token <= local + 1) && local + 1 <= token) && 0 == t2_st)) || (((((((t2_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && 0 == t2_st) && token <= local) && local <= token)) || ((((((((E_2 == 2 && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((E_2 == 2 && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((((token <= local + 1 && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && __retres1 == 0)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-10-24 10:00:09,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21a262a1-196a-4450-8da8-2d4260bd86b0/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...