./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:13:44,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:13:44,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:13:44,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:13:44,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:13:44,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:13:44,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:13:44,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:13:44,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:13:44,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:13:44,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:13:44,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:13:44,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:13:44,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:13:44,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:13:44,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:13:44,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:13:44,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:13:44,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:13:44,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:13:44,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:13:44,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:13:44,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:13:44,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:13:44,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:13:44,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:13:44,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:13:44,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:13:44,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:13:44,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:13:44,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:13:44,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:13:44,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:13:44,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:13:44,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:13:44,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:13:44,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:13:44,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:13:44,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:13:44,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:13:44,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:13:44,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 20:13:44,499 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:13:44,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:13:44,500 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:13:44,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:13:44,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:13:44,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:13:44,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:13:44,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:13:44,502 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:13:44,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:13:44,502 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:13:44,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:13:44,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:13:44,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:13:44,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:13:44,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:13:44,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:13:44,504 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:13:44,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:13:44,504 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:13:44,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:13:44,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:13:44,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:13:44,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:13:44,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:13:44,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:13:44,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:13:44,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:13:44,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:13:44,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa 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 -> Automizer 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2021-12-06 20:13:44,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:13:44,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:13:44,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:13:44,744 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:13:44,744 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:13:44,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-12-06 20:13:44,794 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/data/c19ca24bf/6ea63de95d4b48e5b607beea836162ca/FLAGb09560e34 [2021-12-06 20:13:45,215 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:13:45,216 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-12-06 20:13:45,224 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/data/c19ca24bf/6ea63de95d4b48e5b607beea836162ca/FLAGb09560e34 [2021-12-06 20:13:45,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/data/c19ca24bf/6ea63de95d4b48e5b607beea836162ca [2021-12-06 20:13:45,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:13:45,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:13:45,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:13:45,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:13:45,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:13:45,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174573ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45, skipping insertion in model container [2021-12-06 20:13:45,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:13:45,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:13:45,363 WARN L230 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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-12-06 20:13:45,397 WARN L230 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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-12-06 20:13:45,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:13:45,425 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:13:45,437 WARN L230 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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-12-06 20:13:45,449 WARN L230 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_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-12-06 20:13:45,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:13:45,476 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:13:45,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45 WrapperNode [2021-12-06 20:13:45,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:13:45,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:13:45,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:13:45,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:13:45,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,515 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2021-12-06 20:13:45,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:13:45,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:13:45,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:13:45,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:13:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:13:45,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:13:45,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:13:45,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:13:45,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (1/1) ... [2021-12-06 20:13:45,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:13:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:45,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:13:45,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:13:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:13:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 20:13:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 20:13:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-12-06 20:13:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-12-06 20:13:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 20:13:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 20:13:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 20:13:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 20:13:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 20:13:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 20:13:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 20:13:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 20:13:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 20:13:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 20:13:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:13:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 20:13:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 20:13:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:13:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:13:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 20:13:45,627 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 20:13:45,703 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:13:45,705 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:13:45,997 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:13:46,004 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:13:46,004 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-06 20:13:46,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:13:46 BoogieIcfgContainer [2021-12-06 20:13:46,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:13:46,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:13:46,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:13:46,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:13:46,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:13:45" (1/3) ... [2021-12-06 20:13:46,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be3c6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:13:46, skipping insertion in model container [2021-12-06 20:13:46,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:13:45" (2/3) ... [2021-12-06 20:13:46,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be3c6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:13:46, skipping insertion in model container [2021-12-06 20:13:46,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:13:46" (3/3) ... [2021-12-06 20:13:46,013 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-12-06 20:13:46,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:13:46,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 20:13:46,055 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:13:46,060 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=PETRI_NET, 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-12-06 20:13:46,061 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 20:13:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-12-06 20:13:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 20:13:46,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:46,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:46,086 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2021-12-06 20:13:46,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:46,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840417407] [2021-12-06 20:13:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:46,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 20:13:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:46,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840417407] [2021-12-06 20:13:46,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840417407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:46,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:46,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:13:46,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097608419] [2021-12-06 20:13:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:46,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:46,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:13:46,344 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:46,525 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2021-12-06 20:13:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:13:46,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-06 20:13:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:46,538 INFO L225 Difference]: With dead ends: 414 [2021-12-06 20:13:46,538 INFO L226 Difference]: Without dead ends: 239 [2021-12-06 20:13:46,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:46,545 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:46,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-06 20:13:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-06 20:13:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2021-12-06 20:13:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2021-12-06 20:13:46,604 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2021-12-06 20:13:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:46,604 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2021-12-06 20:13:46,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2021-12-06 20:13:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 20:13:46,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:46,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:46,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:13:46,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2021-12-06 20:13:46,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613360639] [2021-12-06 20:13:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:46,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-06 20:13:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:46,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613360639] [2021-12-06 20:13:46,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613360639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:46,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:46,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:13:46,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624987914] [2021-12-06 20:13:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:46,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:46,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:13:46,681 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:46,822 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2021-12-06 20:13:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:13:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-06 20:13:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:46,825 INFO L225 Difference]: With dead ends: 481 [2021-12-06 20:13:46,826 INFO L226 Difference]: Without dead ends: 357 [2021-12-06 20:13:46,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:46,828 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:46,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 585 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-06 20:13:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2021-12-06 20:13:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2021-12-06 20:13:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2021-12-06 20:13:46,855 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2021-12-06 20:13:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:46,855 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2021-12-06 20:13:46,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2021-12-06 20:13:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 20:13:46,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:46,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:46,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:13:46,858 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2021-12-06 20:13:46,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:46,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686443010] [2021-12-06 20:13:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:46,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-06 20:13:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:46,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:46,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686443010] [2021-12-06 20:13:46,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686443010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:46,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:46,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:13:46,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315539053] [2021-12-06 20:13:46,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:46,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:46,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:13:46,913 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:47,008 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2021-12-06 20:13:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:13:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-06 20:13:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:47,012 INFO L225 Difference]: With dead ends: 708 [2021-12-06 20:13:47,012 INFO L226 Difference]: Without dead ends: 517 [2021-12-06 20:13:47,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:47,014 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:47,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 464 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-12-06 20:13:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2021-12-06 20:13:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-12-06 20:13:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2021-12-06 20:13:47,050 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2021-12-06 20:13:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:47,050 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2021-12-06 20:13:47,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 20:13:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2021-12-06 20:13:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:47,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:47,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:47,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:13:47,054 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2021-12-06 20:13:47,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:47,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034940065] [2021-12-06 20:13:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:47,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:47,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:47,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034940065] [2021-12-06 20:13:47,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034940065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:47,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:47,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:13:47,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576498866] [2021-12-06 20:13:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:47,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:13:47,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:13:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:47,115 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:47,318 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2021-12-06 20:13:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:13:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:47,323 INFO L225 Difference]: With dead ends: 582 [2021-12-06 20:13:47,323 INFO L226 Difference]: Without dead ends: 486 [2021-12-06 20:13:47,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:13:47,326 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:47,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 527 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-12-06 20:13:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2021-12-06 20:13:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-12-06 20:13:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2021-12-06 20:13:47,371 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2021-12-06 20:13:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:47,372 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2021-12-06 20:13:47,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2021-12-06 20:13:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:47,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:47,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:47,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:13:47,376 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2021-12-06 20:13:47,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:47,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737315795] [2021-12-06 20:13:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:47,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:47,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737315795] [2021-12-06 20:13:47,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737315795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:47,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:47,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:13:47,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911841203] [2021-12-06 20:13:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:47,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:13:47,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:13:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:13:47,453 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:47,797 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2021-12-06 20:13:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:13:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:47,801 INFO L225 Difference]: With dead ends: 689 [2021-12-06 20:13:47,801 INFO L226 Difference]: Without dead ends: 596 [2021-12-06 20:13:47,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:13:47,803 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 434 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:47,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 689 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-06 20:13:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2021-12-06 20:13:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2021-12-06 20:13:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2021-12-06 20:13:47,836 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2021-12-06 20:13:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:47,836 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2021-12-06 20:13:47,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2021-12-06 20:13:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:47,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:47,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:47,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:13:47,839 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2021-12-06 20:13:47,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:47,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140288863] [2021-12-06 20:13:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:47,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:47,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140288863] [2021-12-06 20:13:47,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140288863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:47,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:47,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:47,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320673336] [2021-12-06 20:13:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:47,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:47,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:47,912 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:48,352 INFO L93 Difference]: Finished difference Result 887 states and 1237 transitions. [2021-12-06 20:13:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:13:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:48,356 INFO L225 Difference]: With dead ends: 887 [2021-12-06 20:13:48,356 INFO L226 Difference]: Without dead ends: 704 [2021-12-06 20:13:48,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:13:48,358 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 424 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:48,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1018 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-12-06 20:13:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2021-12-06 20:13:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2021-12-06 20:13:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 880 transitions. [2021-12-06 20:13:48,390 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 880 transitions. Word has length 57 [2021-12-06 20:13:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:48,391 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 880 transitions. [2021-12-06 20:13:48,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 880 transitions. [2021-12-06 20:13:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:48,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:48,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:48,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:13:48,393 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2021-12-06 20:13:48,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52328271] [2021-12-06 20:13:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:48,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:48,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:48,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52328271] [2021-12-06 20:13:48,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52328271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:48,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:48,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:48,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955750791] [2021-12-06 20:13:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:48,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:48,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:48,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:48,451 INFO L87 Difference]: Start difference. First operand 640 states and 880 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:48,912 INFO L93 Difference]: Finished difference Result 1198 states and 1670 transitions. [2021-12-06 20:13:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:13:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:48,919 INFO L225 Difference]: With dead ends: 1198 [2021-12-06 20:13:48,919 INFO L226 Difference]: Without dead ends: 930 [2021-12-06 20:13:48,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:13:48,921 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 435 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:48,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 989 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-12-06 20:13:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2021-12-06 20:13:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2021-12-06 20:13:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2021-12-06 20:13:48,975 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 57 [2021-12-06 20:13:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:48,976 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2021-12-06 20:13:48,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2021-12-06 20:13:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:48,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:48,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:48,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:13:48,978 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2021-12-06 20:13:48,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:48,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606518636] [2021-12-06 20:13:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:48,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:49,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:49,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606518636] [2021-12-06 20:13:49,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606518636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:49,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:49,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:49,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219458308] [2021-12-06 20:13:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:49,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:49,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:49,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:49,054 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:49,392 INFO L93 Difference]: Finished difference Result 1381 states and 1951 transitions. [2021-12-06 20:13:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:13:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:49,397 INFO L225 Difference]: With dead ends: 1381 [2021-12-06 20:13:49,397 INFO L226 Difference]: Without dead ends: 956 [2021-12-06 20:13:49,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:13:49,399 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 224 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:49,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 937 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:13:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-12-06 20:13:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 813. [2021-12-06 20:13:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2021-12-06 20:13:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1116 transitions. [2021-12-06 20:13:49,437 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1116 transitions. Word has length 57 [2021-12-06 20:13:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:49,438 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1116 transitions. [2021-12-06 20:13:49,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1116 transitions. [2021-12-06 20:13:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:49,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:49,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:49,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:13:49,439 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2021-12-06 20:13:49,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516030197] [2021-12-06 20:13:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:49,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:49,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516030197] [2021-12-06 20:13:49,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516030197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:49,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:49,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:13:49,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606136202] [2021-12-06 20:13:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:49,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:13:49,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:13:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:13:49,488 INFO L87 Difference]: Start difference. First operand 813 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:49,859 INFO L93 Difference]: Finished difference Result 1803 states and 2499 transitions. [2021-12-06 20:13:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:13:49,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:49,866 INFO L225 Difference]: With dead ends: 1803 [2021-12-06 20:13:49,866 INFO L226 Difference]: Without dead ends: 1363 [2021-12-06 20:13:49,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:13:49,868 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 563 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:49,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 787 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2021-12-06 20:13:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1204. [2021-12-06 20:13:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2021-12-06 20:13:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1644 transitions. [2021-12-06 20:13:49,922 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1644 transitions. Word has length 57 [2021-12-06 20:13:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:49,923 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 1644 transitions. [2021-12-06 20:13:49,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1644 transitions. [2021-12-06 20:13:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:49,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:49,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:49,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:13:49,924 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2021-12-06 20:13:49,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:49,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533730762] [2021-12-06 20:13:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:49,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:49,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533730762] [2021-12-06 20:13:49,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533730762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:49,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:49,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:49,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805372250] [2021-12-06 20:13:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:49,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:49,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:49,988 INFO L87 Difference]: Start difference. First operand 1204 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:50,329 INFO L93 Difference]: Finished difference Result 2242 states and 3103 transitions. [2021-12-06 20:13:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:13:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:50,339 INFO L225 Difference]: With dead ends: 2242 [2021-12-06 20:13:50,339 INFO L226 Difference]: Without dead ends: 1411 [2021-12-06 20:13:50,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:13:50,343 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 190 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:50,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 915 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:13:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-12-06 20:13:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1219. [2021-12-06 20:13:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2021-12-06 20:13:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1654 transitions. [2021-12-06 20:13:50,426 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1654 transitions. Word has length 57 [2021-12-06 20:13:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:50,426 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1654 transitions. [2021-12-06 20:13:50,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1654 transitions. [2021-12-06 20:13:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:50,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:50,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:50,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:13:50,429 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2021-12-06 20:13:50,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:50,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776827940] [2021-12-06 20:13:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:50,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:50,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:50,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776827940] [2021-12-06 20:13:50,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776827940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:50,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:50,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:13:50,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358871950] [2021-12-06 20:13:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:50,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:13:50,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:13:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:13:50,497 INFO L87 Difference]: Start difference. First operand 1219 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:50,911 INFO L93 Difference]: Finished difference Result 1767 states and 2397 transitions. [2021-12-06 20:13:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:13:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:50,917 INFO L225 Difference]: With dead ends: 1767 [2021-12-06 20:13:50,917 INFO L226 Difference]: Without dead ends: 1237 [2021-12-06 20:13:50,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:13:50,919 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 487 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:50,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 906 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2021-12-06 20:13:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1051. [2021-12-06 20:13:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2021-12-06 20:13:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1411 transitions. [2021-12-06 20:13:50,966 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1411 transitions. Word has length 57 [2021-12-06 20:13:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:50,966 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 1411 transitions. [2021-12-06 20:13:50,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1411 transitions. [2021-12-06 20:13:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:50,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:50,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:50,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:13:50,968 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2021-12-06 20:13:50,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:50,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859473520] [2021-12-06 20:13:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:50,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:51,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:51,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859473520] [2021-12-06 20:13:51,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859473520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:51,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:51,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:13:51,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798269572] [2021-12-06 20:13:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:51,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:13:51,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:13:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:13:51,027 INFO L87 Difference]: Start difference. First operand 1051 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:51,443 INFO L93 Difference]: Finished difference Result 2334 states and 3104 transitions. [2021-12-06 20:13:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 20:13:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:51,451 INFO L225 Difference]: With dead ends: 2334 [2021-12-06 20:13:51,451 INFO L226 Difference]: Without dead ends: 1657 [2021-12-06 20:13:51,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-06 20:13:51,454 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 493 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:51,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 921 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-06 20:13:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1365. [2021-12-06 20:13:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2021-12-06 20:13:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1819 transitions. [2021-12-06 20:13:51,518 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1819 transitions. Word has length 57 [2021-12-06 20:13:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:51,519 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 1819 transitions. [2021-12-06 20:13:51,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1819 transitions. [2021-12-06 20:13:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:51,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:51,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:51,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:13:51,521 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2021-12-06 20:13:51,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:51,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124600712] [2021-12-06 20:13:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:51,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:51,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124600712] [2021-12-06 20:13:51,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124600712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:51,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:51,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:13:51,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994193727] [2021-12-06 20:13:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:51,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:13:51,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:13:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:13:51,582 INFO L87 Difference]: Start difference. First operand 1365 states and 1819 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:52,005 INFO L93 Difference]: Finished difference Result 2334 states and 3094 transitions. [2021-12-06 20:13:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 20:13:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-06 20:13:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:52,012 INFO L225 Difference]: With dead ends: 2334 [2021-12-06 20:13:52,012 INFO L226 Difference]: Without dead ends: 1633 [2021-12-06 20:13:52,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-06 20:13:52,015 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 479 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:52,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 902 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-06 20:13:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1355. [2021-12-06 20:13:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2021-12-06 20:13:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1797 transitions. [2021-12-06 20:13:52,102 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1797 transitions. Word has length 57 [2021-12-06 20:13:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:52,102 INFO L470 AbstractCegarLoop]: Abstraction has 1355 states and 1797 transitions. [2021-12-06 20:13:52,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:13:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1797 transitions. [2021-12-06 20:13:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:13:52,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:52,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:13:52,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 20:13:52,104 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2021-12-06 20:13:52,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:52,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564737387] [2021-12-06 20:13:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:52,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:52,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:52,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564737387] [2021-12-06 20:13:52,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564737387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:52,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:52,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:13:52,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281740767] [2021-12-06 20:13:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:52,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:13:52,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:13:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:52,150 INFO L87 Difference]: Start difference. First operand 1355 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 20:13:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:52,387 INFO L93 Difference]: Finished difference Result 2962 states and 3933 transitions. [2021-12-06 20:13:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:13:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2021-12-06 20:13:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:52,398 INFO L225 Difference]: With dead ends: 2962 [2021-12-06 20:13:52,398 INFO L226 Difference]: Without dead ends: 1977 [2021-12-06 20:13:52,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:13:52,402 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 443 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:52,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 519 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-12-06 20:13:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1759. [2021-12-06 20:13:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2021-12-06 20:13:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2301 transitions. [2021-12-06 20:13:52,511 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2301 transitions. Word has length 57 [2021-12-06 20:13:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:52,511 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2301 transitions. [2021-12-06 20:13:52,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-06 20:13:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2301 transitions. [2021-12-06 20:13:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:13:52,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:52,513 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 20:13:52,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 20:13:52,513 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2021-12-06 20:13:52,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700947639] [2021-12-06 20:13:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:52,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:13:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:13:52,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:52,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700947639] [2021-12-06 20:13:52,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700947639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:52,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:52,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:13:52,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762555859] [2021-12-06 20:13:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:52,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:52,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:52,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:13:52,542 INFO L87 Difference]: Start difference. First operand 1759 states and 2301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 20:13:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:52,707 INFO L93 Difference]: Finished difference Result 2343 states and 3086 transitions. [2021-12-06 20:13:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:13:52,708 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2021-12-06 20:13:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:52,715 INFO L225 Difference]: With dead ends: 2343 [2021-12-06 20:13:52,716 INFO L226 Difference]: Without dead ends: 1987 [2021-12-06 20:13:52,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:52,718 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 132 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:52,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 620 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2021-12-06 20:13:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1949. [2021-12-06 20:13:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2021-12-06 20:13:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2539 transitions. [2021-12-06 20:13:52,828 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2539 transitions. Word has length 62 [2021-12-06 20:13:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:52,828 INFO L470 AbstractCegarLoop]: Abstraction has 1949 states and 2539 transitions. [2021-12-06 20:13:52,828 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 20:13:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2539 transitions. [2021-12-06 20:13:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 20:13:52,834 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:52,834 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 20:13:52,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 20:13:52,834 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2021-12-06 20:13:52,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:52,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141882437] [2021-12-06 20:13:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:52,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 20:13:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 20:13:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 20:13:52,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141882437] [2021-12-06 20:13:52,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141882437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:52,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:52,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:13:52,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103936850] [2021-12-06 20:13:52,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:52,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:52,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:52,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:13:52,865 INFO L87 Difference]: Start difference. First operand 1949 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 20:13:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:52,986 INFO L93 Difference]: Finished difference Result 2602 states and 3392 transitions. [2021-12-06 20:13:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:13:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2021-12-06 20:13:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:52,994 INFO L225 Difference]: With dead ends: 2602 [2021-12-06 20:13:52,994 INFO L226 Difference]: Without dead ends: 2148 [2021-12-06 20:13:52,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:52,996 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 279 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:52,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 459 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2021-12-06 20:13:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2093. [2021-12-06 20:13:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2021-12-06 20:13:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2712 transitions. [2021-12-06 20:13:53,087 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2712 transitions. Word has length 67 [2021-12-06 20:13:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:53,087 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 2712 transitions. [2021-12-06 20:13:53,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 20:13:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2712 transitions. [2021-12-06 20:13:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 20:13:53,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:53,089 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:53,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 20:13:53,089 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2021-12-06 20:13:53,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:53,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716181508] [2021-12-06 20:13:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:53,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 20:13:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 20:13:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 20:13:53,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716181508] [2021-12-06 20:13:53,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716181508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:53,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704287400] [2021-12-06 20:13:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:53,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:53,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:13:53,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:13:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 20:13:53,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:13:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:53,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:13:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 20:13:53,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704287400] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:53,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:13:53,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-12-06 20:13:53,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793900359] [2021-12-06 20:13:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:53,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:13:53,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:13:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:13:53,388 INFO L87 Difference]: Start difference. First operand 2093 states and 2712 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 20:13:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:53,547 INFO L93 Difference]: Finished difference Result 2149 states and 2780 transitions. [2021-12-06 20:13:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:13:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2021-12-06 20:13:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:53,555 INFO L225 Difference]: With dead ends: 2149 [2021-12-06 20:13:53,555 INFO L226 Difference]: Without dead ends: 2146 [2021-12-06 20:13:53,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:13:53,557 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 399 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:53,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 328 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:13:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-12-06 20:13:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2092. [2021-12-06 20:13:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2021-12-06 20:13:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2709 transitions. [2021-12-06 20:13:53,642 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2709 transitions. Word has length 68 [2021-12-06 20:13:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:53,643 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 2709 transitions. [2021-12-06 20:13:53,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 20:13:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2709 transitions. [2021-12-06 20:13:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 20:13:53,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:53,645 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:53,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:13:53,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:53,846 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2021-12-06 20:13:53,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:53,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020838133] [2021-12-06 20:13:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:53,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 20:13:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 20:13:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 20:13:53,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020838133] [2021-12-06 20:13:53,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020838133] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:53,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154627487] [2021-12-06 20:13:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:53,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:53,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:53,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:13:53,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:13:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:54,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 20:13:54,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:13:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:13:54,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:13:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 20:13:54,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154627487] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:13:54,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:13:54,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-12-06 20:13:54,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392743984] [2021-12-06 20:13:54,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:13:54,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:13:54,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:13:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:13:54,327 INFO L87 Difference]: Start difference. First operand 2092 states and 2709 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-06 20:13:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:54,973 INFO L93 Difference]: Finished difference Result 3792 states and 4929 transitions. [2021-12-06 20:13:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-06 20:13:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2021-12-06 20:13:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:54,986 INFO L225 Difference]: With dead ends: 3792 [2021-12-06 20:13:54,986 INFO L226 Difference]: Without dead ends: 3248 [2021-12-06 20:13:54,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-12-06 20:13:54,989 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 636 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:54,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 2330 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2021-12-06 20:13:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2481. [2021-12-06 20:13:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2021-12-06 20:13:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3197 transitions. [2021-12-06 20:13:55,112 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3197 transitions. Word has length 69 [2021-12-06 20:13:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:55,112 INFO L470 AbstractCegarLoop]: Abstraction has 2481 states and 3197 transitions. [2021-12-06 20:13:55,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-06 20:13:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3197 transitions. [2021-12-06 20:13:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-06 20:13:55,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:55,116 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:55,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:13:55,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 20:13:55,318 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2021-12-06 20:13:55,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:55,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837709887] [2021-12-06 20:13:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:55,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 20:13:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:13:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 20:13:55,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:55,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837709887] [2021-12-06 20:13:55,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837709887] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:55,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329299773] [2021-12-06 20:13:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:55,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:55,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:13:55,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:13:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:55,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:13:55,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:13:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 20:13:55,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:13:55,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329299773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:55,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:13:55,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 20:13:55,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764020389] [2021-12-06 20:13:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:55,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:13:55,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:13:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:55,559 INFO L87 Difference]: Start difference. First operand 2481 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 20:13:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:55,658 INFO L93 Difference]: Finished difference Result 3204 states and 4135 transitions. [2021-12-06 20:13:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:13:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2021-12-06 20:13:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:55,667 INFO L225 Difference]: With dead ends: 3204 [2021-12-06 20:13:55,667 INFO L226 Difference]: Without dead ends: 2359 [2021-12-06 20:13:55,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:55,669 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:55,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:13:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2021-12-06 20:13:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2344. [2021-12-06 20:13:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2021-12-06 20:13:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3017 transitions. [2021-12-06 20:13:55,782 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3017 transitions. Word has length 88 [2021-12-06 20:13:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:55,782 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 3017 transitions. [2021-12-06 20:13:55,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 20:13:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3017 transitions. [2021-12-06 20:13:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-06 20:13:55,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:55,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1] [2021-12-06 20:13:55,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 20:13:55,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:55,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:55,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:55,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2021-12-06 20:13:55,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:55,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316364635] [2021-12-06 20:13:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:55,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:13:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 20:13:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 20:13:56,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316364635] [2021-12-06 20:13:56,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316364635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:56,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:56,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:56,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690404299] [2021-12-06 20:13:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:56,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:56,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:56,076 INFO L87 Difference]: Start difference. First operand 2344 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:13:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:56,463 INFO L93 Difference]: Finished difference Result 5463 states and 7157 transitions. [2021-12-06 20:13:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:13:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-12-06 20:13:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:56,476 INFO L225 Difference]: With dead ends: 5463 [2021-12-06 20:13:56,476 INFO L226 Difference]: Without dead ends: 4080 [2021-12-06 20:13:56,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:13:56,480 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 784 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:56,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 504 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:13:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2021-12-06 20:13:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3682. [2021-12-06 20:13:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2021-12-06 20:13:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4767 transitions. [2021-12-06 20:13:56,658 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4767 transitions. Word has length 92 [2021-12-06 20:13:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:56,658 INFO L470 AbstractCegarLoop]: Abstraction has 3682 states and 4767 transitions. [2021-12-06 20:13:56,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:13:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4767 transitions. [2021-12-06 20:13:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-06 20:13:56,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:56,661 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1] [2021-12-06 20:13:56,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 20:13:56,662 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2021-12-06 20:13:56,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:56,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551647970] [2021-12-06 20:13:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:56,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:13:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 20:13:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 20:13:56,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551647970] [2021-12-06 20:13:56,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551647970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:56,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:56,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:13:56,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737777457] [2021-12-06 20:13:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:56,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:13:56,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:13:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:13:56,709 INFO L87 Difference]: Start difference. First operand 3682 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:13:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:56,996 INFO L93 Difference]: Finished difference Result 6081 states and 7883 transitions. [2021-12-06 20:13:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:13:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2021-12-06 20:13:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:57,008 INFO L225 Difference]: With dead ends: 6081 [2021-12-06 20:13:57,008 INFO L226 Difference]: Without dead ends: 3360 [2021-12-06 20:13:57,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:13:57,013 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 301 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:57,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 483 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:13:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2021-12-06 20:13:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3048. [2021-12-06 20:13:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2528 states have (on average 1.2796677215189873) internal successors, (3235), 2579 states have internal predecessors, (3235), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2021-12-06 20:13:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3929 transitions. [2021-12-06 20:13:57,154 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3929 transitions. Word has length 92 [2021-12-06 20:13:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:57,154 INFO L470 AbstractCegarLoop]: Abstraction has 3048 states and 3929 transitions. [2021-12-06 20:13:57,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:13:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3929 transitions. [2021-12-06 20:13:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 20:13:57,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:57,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-12-06 20:13:57,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 20:13:57,157 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2021-12-06 20:13:57,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:57,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809677388] [2021-12-06 20:13:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:57,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:13:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 20:13:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:13:57,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809677388] [2021-12-06 20:13:57,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809677388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:57,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:57,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:13:57,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840920121] [2021-12-06 20:13:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:57,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:13:57,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:13:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:57,217 INFO L87 Difference]: Start difference. First operand 3048 states and 3929 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:13:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:57,891 INFO L93 Difference]: Finished difference Result 6551 states and 8590 transitions. [2021-12-06 20:13:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 20:13:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2021-12-06 20:13:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:57,901 INFO L225 Difference]: With dead ends: 6551 [2021-12-06 20:13:57,901 INFO L226 Difference]: Without dead ends: 4464 [2021-12-06 20:13:57,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-06 20:13:57,906 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1168 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:57,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 816 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:13:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2021-12-06 20:13:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4168. [2021-12-06 20:13:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3452 states have (on average 1.2604287369640788) internal successors, (4351), 3527 states have internal predecessors, (4351), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2021-12-06 20:13:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5296 transitions. [2021-12-06 20:13:58,121 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5296 transitions. Word has length 93 [2021-12-06 20:13:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:58,121 INFO L470 AbstractCegarLoop]: Abstraction has 4168 states and 5296 transitions. [2021-12-06 20:13:58,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:13:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5296 transitions. [2021-12-06 20:13:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-06 20:13:58,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:58,124 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2021-12-06 20:13:58,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 20:13:58,124 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2021-12-06 20:13:58,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:58,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366917219] [2021-12-06 20:13:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:58,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:13:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 20:13:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-06 20:13:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 20:13:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 20:13:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 20:13:58,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366917219] [2021-12-06 20:13:58,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366917219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881653256] [2021-12-06 20:13:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:58,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:58,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:58,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:13:58,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 20:13:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:13:58,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:13:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:13:58,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:13:58,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881653256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:58,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:13:58,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 20:13:58,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265694653] [2021-12-06 20:13:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:58,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:13:58,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:13:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:58,332 INFO L87 Difference]: Start difference. First operand 4168 states and 5296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 20:13:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:58,539 INFO L93 Difference]: Finished difference Result 4547 states and 5764 transitions. [2021-12-06 20:13:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:13:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2021-12-06 20:13:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:58,547 INFO L225 Difference]: With dead ends: 4547 [2021-12-06 20:13:58,547 INFO L226 Difference]: Without dead ends: 3221 [2021-12-06 20:13:58,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:13:58,550 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 62 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:58,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:13:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2021-12-06 20:13:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2021-12-06 20:13:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2608 states have (on average 1.2626533742331287) internal successors, (3293), 2667 states have internal predecessors, (3293), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2021-12-06 20:13:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4089 transitions. [2021-12-06 20:13:58,716 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4089 transitions. Word has length 103 [2021-12-06 20:13:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:58,717 INFO L470 AbstractCegarLoop]: Abstraction has 3221 states and 4089 transitions. [2021-12-06 20:13:58,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 20:13:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4089 transitions. [2021-12-06 20:13:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 20:13:58,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:58,719 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:58,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 20:13:58,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 20:13:58,920 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 199854852, now seen corresponding path program 1 times [2021-12-06 20:13:58,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:58,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729666928] [2021-12-06 20:13:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:58,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:13:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:13:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:13:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 20:13:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-06 20:13:58,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:58,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729666928] [2021-12-06 20:13:58,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729666928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:13:58,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:13:58,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:13:58,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043073890] [2021-12-06 20:13:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:13:58,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:13:58,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:13:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:13:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:13:58,989 INFO L87 Difference]: Start difference. First operand 3221 states and 4089 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 20:13:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:13:59,668 INFO L93 Difference]: Finished difference Result 7795 states and 10213 transitions. [2021-12-06 20:13:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 20:13:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 135 [2021-12-06 20:13:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:13:59,678 INFO L225 Difference]: With dead ends: 7795 [2021-12-06 20:13:59,678 INFO L226 Difference]: Without dead ends: 4713 [2021-12-06 20:13:59,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:13:59,684 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 758 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:13:59,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 421 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:13:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2021-12-06 20:13:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4229. [2021-12-06 20:13:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4229 states, 3447 states have (on average 1.2236727589208007) internal successors, (4218), 3552 states have internal predecessors, (4218), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2021-12-06 20:13:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5202 transitions. [2021-12-06 20:13:59,927 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5202 transitions. Word has length 135 [2021-12-06 20:13:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:13:59,928 INFO L470 AbstractCegarLoop]: Abstraction has 4229 states and 5202 transitions. [2021-12-06 20:13:59,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 20:13:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5202 transitions. [2021-12-06 20:13:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 20:13:59,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:13:59,931 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:13:59,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 20:13:59,931 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:13:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:13:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 2 times [2021-12-06 20:13:59,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:13:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551426594] [2021-12-06 20:13:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:13:59,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:13:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:13:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:13:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:13:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:13:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:13:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:13:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:13:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:13:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:13:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 20:13:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:13:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-06 20:13:59,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:13:59,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551426594] [2021-12-06 20:13:59,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551426594] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:13:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764012654] [2021-12-06 20:13:59,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 20:13:59,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:13:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:13:59,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:13:59,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 20:14:00,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 20:14:00,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:14:00,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:14:00,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:14:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 20:14:00,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:14:00,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764012654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:00,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:14:00,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 20:14:00,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800095816] [2021-12-06 20:14:00,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:00,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:14:00,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:14:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:14:00,174 INFO L87 Difference]: Start difference. First operand 4229 states and 5202 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 20:14:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:00,378 INFO L93 Difference]: Finished difference Result 7017 states and 8818 transitions. [2021-12-06 20:14:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:14:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2021-12-06 20:14:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:00,387 INFO L225 Difference]: With dead ends: 7017 [2021-12-06 20:14:00,387 INFO L226 Difference]: Without dead ends: 4105 [2021-12-06 20:14:00,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:14:00,393 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:00,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:14:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2021-12-06 20:14:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4079. [2021-12-06 20:14:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 3297 states have (on average 1.2095844707309675) internal successors, (3988), 3402 states have internal predecessors, (3988), 393 states have call successors, (393), 285 states have call predecessors, (393), 388 states have return successors, (591), 393 states have call predecessors, (591), 393 states have call successors, (591) [2021-12-06 20:14:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 4972 transitions. [2021-12-06 20:14:00,616 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 4972 transitions. Word has length 135 [2021-12-06 20:14:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:00,616 INFO L470 AbstractCegarLoop]: Abstraction has 4079 states and 4972 transitions. [2021-12-06 20:14:00,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 20:14:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 4972 transitions. [2021-12-06 20:14:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 20:14:00,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:14:00,619 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:14:00,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 20:14:00,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 20:14:00,820 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:14:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:14:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2021-12-06 20:14:00,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:14:00,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100732666] [2021-12-06 20:14:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:00,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:14:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:14:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:14:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:14:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:14:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:14:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:14:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:14:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:14:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:14:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-06 20:14:00,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:14:00,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100732666] [2021-12-06 20:14:00,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100732666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:00,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:14:00,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:14:00,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921050518] [2021-12-06 20:14:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:00,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:14:00,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:14:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:14:00,900 INFO L87 Difference]: Start difference. First operand 4079 states and 4972 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 20:14:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:01,620 INFO L93 Difference]: Finished difference Result 11890 states and 14610 transitions. [2021-12-06 20:14:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:14:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-12-06 20:14:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:01,635 INFO L225 Difference]: With dead ends: 11890 [2021-12-06 20:14:01,635 INFO L226 Difference]: Without dead ends: 8818 [2021-12-06 20:14:01,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:14:01,642 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 541 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:01,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 528 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:14:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2021-12-06 20:14:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 7140. [2021-12-06 20:14:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 5815 states have (on average 1.2257953568357696) internal successors, (7128), 5993 states have internal predecessors, (7128), 662 states have call successors, (662), 483 states have call predecessors, (662), 662 states have return successors, (1008), 665 states have call predecessors, (1008), 662 states have call successors, (1008) [2021-12-06 20:14:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 8798 transitions. [2021-12-06 20:14:02,031 INFO L78 Accepts]: Start accepts. Automaton has 7140 states and 8798 transitions. Word has length 136 [2021-12-06 20:14:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:02,031 INFO L470 AbstractCegarLoop]: Abstraction has 7140 states and 8798 transitions. [2021-12-06 20:14:02,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 20:14:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7140 states and 8798 transitions. [2021-12-06 20:14:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 20:14:02,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:14:02,036 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:14:02,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 20:14:02,036 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:14:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:14:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1255313462, now seen corresponding path program 1 times [2021-12-06 20:14:02,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:14:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176334674] [2021-12-06 20:14:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:02,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:14:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:14:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:14:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:14:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:14:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:14:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:14:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 20:14:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 20:14:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 20:14:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 20:14:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 20:14:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:14:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 20:14:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 20:14:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-06 20:14:02,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:14:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176334674] [2021-12-06 20:14:02,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176334674] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:14:02,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710434397] [2021-12-06 20:14:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:02,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:14:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:14:02,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:14:02,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 20:14:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 20:14:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:14:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 20:14:02,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:14:02,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710434397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:02,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:14:02,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-12-06 20:14:02,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210352793] [2021-12-06 20:14:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:02,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:14:02,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:14:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:14:02,316 INFO L87 Difference]: Start difference. First operand 7140 states and 8798 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 20:14:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:02,504 INFO L93 Difference]: Finished difference Result 10848 states and 13407 transitions. [2021-12-06 20:14:02,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:14:02,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2021-12-06 20:14:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:02,511 INFO L225 Difference]: With dead ends: 10848 [2021-12-06 20:14:02,511 INFO L226 Difference]: Without dead ends: 3722 [2021-12-06 20:14:02,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:14:02,522 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:02,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 684 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:14:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2021-12-06 20:14:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3450. [2021-12-06 20:14:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2842 states have (on average 1.2149894440534834) internal successors, (3453), 2891 states have internal predecessors, (3453), 308 states have call successors, (308), 213 states have call predecessors, (308), 299 states have return successors, (471), 345 states have call predecessors, (471), 308 states have call successors, (471) [2021-12-06 20:14:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4232 transitions. [2021-12-06 20:14:02,701 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4232 transitions. Word has length 159 [2021-12-06 20:14:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:02,701 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 4232 transitions. [2021-12-06 20:14:02,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 20:14:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4232 transitions. [2021-12-06 20:14:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 20:14:02,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:14:02,704 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 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-12-06 20:14:02,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 20:14:02,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 20:14:02,906 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:14:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:14:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash -790442704, now seen corresponding path program 1 times [2021-12-06 20:14:02,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:14:02,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116168724] [2021-12-06 20:14:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:02,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:14:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:14:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:14:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:14:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:14:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:14:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:14:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 20:14:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 20:14:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 20:14:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 20:14:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 20:14:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 20:14:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 20:14:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 20:14:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-12-06 20:14:02,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:14:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116168724] [2021-12-06 20:14:02,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116168724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:02,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:14:02,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:14:02,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781637430] [2021-12-06 20:14:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:02,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:14:02,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:14:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:14:02,987 INFO L87 Difference]: Start difference. First operand 3450 states and 4232 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-06 20:14:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:03,365 INFO L93 Difference]: Finished difference Result 6175 states and 7543 transitions. [2021-12-06 20:14:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:14:03,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 163 [2021-12-06 20:14:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:03,371 INFO L225 Difference]: With dead ends: 6175 [2021-12-06 20:14:03,371 INFO L226 Difference]: Without dead ends: 2985 [2021-12-06 20:14:03,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-12-06 20:14:03,376 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 613 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:03,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 333 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:14:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-12-06 20:14:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2701. [2021-12-06 20:14:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2262 states have (on average 1.1923076923076923) internal successors, (2697), 2275 states have internal predecessors, (2697), 231 states have call successors, (231), 164 states have call predecessors, (231), 207 states have return successors, (314), 261 states have call predecessors, (314), 231 states have call successors, (314) [2021-12-06 20:14:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3242 transitions. [2021-12-06 20:14:03,545 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3242 transitions. Word has length 163 [2021-12-06 20:14:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:03,546 INFO L470 AbstractCegarLoop]: Abstraction has 2701 states and 3242 transitions. [2021-12-06 20:14:03,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-06 20:14:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3242 transitions. [2021-12-06 20:14:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-06 20:14:03,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:14:03,549 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:14:03,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 20:14:03,549 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:14:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:14:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1045972563, now seen corresponding path program 1 times [2021-12-06 20:14:03,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:14:03,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8776989] [2021-12-06 20:14:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:03,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:14:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:14:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:14:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:14:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:14:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:14:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:14:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 20:14:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 20:14:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 20:14:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 20:14:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 20:14:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 20:14:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 20:14:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 20:14:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-06 20:14:03,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:14:03,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8776989] [2021-12-06 20:14:03,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8776989] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:14:03,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074460685] [2021-12-06 20:14:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:03,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:14:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:14:03,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:14:03,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 20:14:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:03,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:14:03,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:14:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-06 20:14:03,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:14:03,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074460685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:03,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:14:03,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2021-12-06 20:14:03,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117283527] [2021-12-06 20:14:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:03,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:14:03,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:14:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:14:03,901 INFO L87 Difference]: Start difference. First operand 2701 states and 3242 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 20:14:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:04,050 INFO L93 Difference]: Finished difference Result 4595 states and 5560 transitions. [2021-12-06 20:14:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:14:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2021-12-06 20:14:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:04,054 INFO L225 Difference]: With dead ends: 4595 [2021-12-06 20:14:04,054 INFO L226 Difference]: Without dead ends: 2020 [2021-12-06 20:14:04,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:14:04,059 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:04,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:14:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2021-12-06 20:14:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1549. [2021-12-06 20:14:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1294 states have (on average 1.1452859350850078) internal successors, (1482), 1308 states have internal predecessors, (1482), 124 states have call successors, (124), 104 states have call predecessors, (124), 130 states have return successors, (168), 136 states have call predecessors, (168), 124 states have call successors, (168) [2021-12-06 20:14:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1774 transitions. [2021-12-06 20:14:04,146 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1774 transitions. Word has length 164 [2021-12-06 20:14:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:04,146 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 1774 transitions. [2021-12-06 20:14:04,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 20:14:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1774 transitions. [2021-12-06 20:14:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-06 20:14:04,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:14:04,147 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:14:04,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 20:14:04,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 20:14:04,349 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:14:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:14:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2021-12-06 20:14:04,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:14:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098543763] [2021-12-06 20:14:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:04,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:14:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:14:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:14:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:14:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:14:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:14:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:14:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:14:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:14:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:14:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 20:14:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:14:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 20:14:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-06 20:14:04,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:14:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098543763] [2021-12-06 20:14:04,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098543763] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:14:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113042030] [2021-12-06 20:14:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:14:04,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:14:04,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:14:04,417 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:14:04,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 20:14:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:14:04,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:14:04,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:14:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-06 20:14:04,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:14:04,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113042030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:14:04,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:14:04,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 20:14:04,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131784121] [2021-12-06 20:14:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:14:04,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:14:04,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:14:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:14:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:14:04,595 INFO L87 Difference]: Start difference. First operand 1549 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:14:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:14:04,645 INFO L93 Difference]: Finished difference Result 2085 states and 2411 transitions. [2021-12-06 20:14:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:14:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2021-12-06 20:14:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:14:04,646 INFO L225 Difference]: With dead ends: 2085 [2021-12-06 20:14:04,646 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 20:14:04,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:14:04,649 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:14:04,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:14:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 20:14:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 20:14:04,650 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-12-06 20:14:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 20:14:04,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2021-12-06 20:14:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:14:04,650 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 20:14:04,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:14:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 20:14:04,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 20:14:04,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 20:14:04,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 20:14:04,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 20:14:04,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:14:04,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 20:14:23,833 WARN L227 SmtUtils]: Spent 18.40s on a formula simplification. DAG size of input: 140 DAG size of output: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:14:39,517 WARN L227 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:14:55,780 WARN L227 SmtUtils]: Spent 13.85s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:15:10,435 WARN L227 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:15:24,761 WARN L227 SmtUtils]: Spent 13.85s on a formula simplification. DAG size of input: 121 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:15:41,541 WARN L227 SmtUtils]: Spent 14.47s on a formula simplification. DAG size of input: 122 DAG size of output: 121 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:15:51,354 WARN L227 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 120 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:16:14,915 WARN L227 SmtUtils]: Spent 18.70s on a formula simplification. DAG size of input: 143 DAG size of output: 142 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:16:30,848 WARN L227 SmtUtils]: Spent 14.94s on a formula simplification. DAG size of input: 126 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:16:47,453 WARN L227 SmtUtils]: Spent 14.15s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:17:02,326 WARN L227 SmtUtils]: Spent 14.87s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:17:16,853 WARN L227 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:17:33,852 WARN L227 SmtUtils]: Spent 14.66s on a formula simplification. DAG size of input: 125 DAG size of output: 124 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:17:43,839 WARN L227 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-06 20:18:00,640 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2021-12-06 20:18:00,641 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse17 (= ~E_1~0 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~m_i~0 1))) (.cse16 (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (.cse18 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not .cse17)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~token~0 ~local~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0)) .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 ~M_E~0)) (not (= ~m_pc~0 0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_pc~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 (= ~E_1~0 0) .cse14 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse16 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= 2 ~E_M~0)) .cse12 .cse13 .cse14 .cse15)))) [2021-12-06 20:18:00,641 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2021-12-06 20:18:00,641 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse15 (not (= ~p_dw_pc~0 0))) (.cse11 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse12 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse13 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse14 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse18 .cse19)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse10 (and .cse11 .cse12 .cse13 .cse14) .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse15 .cse4 (and .cse18 .cse11 .cse19 .cse12 .cse13 .cse14) .cse5 (not (= ~c_num_read~0 0)) .cse16 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2021-12-06 20:18:00,641 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (let ((.cse0 (not (= ~M_E~0 2))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= 2 |old(~c_dr_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8 .cse9))) [2021-12-06 20:18:00,641 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L858 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2021-12-06 20:18:00,642 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse10 (not (= ~p_dw_pc~0 0))) (.cse13 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse15 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse0 (not (= ~M_E~0 2))) (.cse16 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (and .cse12 .cse14)) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse10 .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse2 .cse3 .cse10 .cse4 (and .cse13 .cse15) .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 .cse17)))) [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse5 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse8 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse19 (not (= 2 |old(~c_dr_st~0)|))) (.cse14 (not (= ~q_free~0 0))) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse15 (not (= ~E_1~0 ~M_E~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse19 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and (= ~c_dr_st~0 2) (or .cse1 .cse21)) .cse18 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse15 .cse21 (and .cse1 .cse2 .cse4 .cse7) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2021-12-06 20:18:00,643 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse22 (= ~E_1~0 1)) (.cse26 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (and .cse26 (= ~t1_st~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~m_pc~0 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse25 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (= |old(~m_st~0)| 0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse21 (and (= |old(~t1_st~0)| ~t1_st~0) .cse26)) (.cse23 (not (= ~t1_pc~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~c_num_read~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse24 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse17 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse5) .cse18 .cse19) (or .cse1 .cse4 .cse5 .cse20 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse25 .cse18) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse25 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19)))) [2021-12-06 20:18:00,644 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (let ((.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse1 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~m_pc~0 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse3 (not (= ~M_E~0 2))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse0 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse24 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse25 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (= |old(~m_st~0)| 0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (= ~m_i~0 1))) (.cse17 (= ~E_1~0 1)) (.cse21 (not (= ~t1_pc~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~c_num_read~0 0))) (.cse15 (not (= ~q_free~0 0))) (.cse22 (not (<= 2 ~E_M~0))) (.cse23 (= ~E_1~0 0)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not .cse17) .cse18 .cse19) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse16 .cse23 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse5) .cse18 .cse19) (or .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse24 .cse25) .cse17 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (not (< ~local~0 ~token~0)) .cse16 .cse23 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse4 .cse5 .cse20 .cse6 .cse17 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse18)))) [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~E_1~0 1)) (.cse23 (= ~T1_E~0 ~M_E~0)) (.cse30 (= ~q_free~0 0)) (.cse26 (= ~c_num_read~0 0)) (.cse22 (= ~p_dw_pc~0 0)) (.cse27 (= ~t1_i~0 1)) (.cse24 (= ~p_num_write~0 0)) (.cse32 (= ~m_i~0 1)) (.cse34 (= ~c_dr_pc~0 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse33 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse37 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse12 (and .cse29 .cse31 (= ~t1_st~0 0) .cse33 .cse36 .cse37)) (.cse13 (not (= ~t1_pc~0 0))) (.cse39 (= ~E_1~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not .cse34)) (.cse4 (= |old(~m_st~0)| 0)) (.cse40 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse32)) (.cse21 (not (= ~t1_pc~0 1))) (.cse8 (not .cse24)) (.cse9 (not .cse27)) (.cse10 (not .cse22)) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not .cse26)) (.cse15 (not .cse30)) (.cse41 (not (<= 2 ~E_M~0))) (.cse25 (<= 1 ~t1_pc~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~m_st~0 0)) (.cse16 (not .cse23)) (.cse17 (not .cse20)) (.cse18 (not .cse35)) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 (not (< ~local~0 ~token~0)) (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse16 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse38 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse39 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse41 .cse16 (not .cse38) .cse39 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~E_1~0 ~M_E~0)) .cse16 (not .cse4) .cse18 .cse19) (or .cse1 .cse3 .cse4 .cse40 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse41 (and .cse28 .cse29 .cse31 .cse33 .cse36 .cse37) .cse39 .cse18) (or .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse8 (and .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse32 .cse34 .cse35) .cse9 .cse10 .cse11 .cse14 .cse15 .cse41 (and .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse38 .cse30 .cse32 .cse34 .cse35) .cse16 .cse17 .cse18 .cse19)))) [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (<= 2 ~E_M~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse16 (= ~E_1~0 0)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse20 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse21 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse6 (not (= ~m_i~0 1))) (.cse23 (not (= ~E_M~0 ~M_E~0))) (.cse24 (not (= ~m_pc~0 0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~t1_pc~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse15 (not (= ~T1_E~0 ~M_E~0))) (.cse19 (= ~E_1~0 1)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse6 (and .cse20 .cse21) .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse15 .cse16 .cse17 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse22 .cse0 .cse1 .cse2 .cse3 .cse6 .cse23 .cse24 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 (not (= ~E_1~0 ~M_E~0)) .cse15 (not .cse4) .cse17 .cse18) (or .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse23 .cse24 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse15 (not .cse19) .cse17 .cse18)))) [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2021-12-06 20:18:00,644 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2021-12-06 20:18:00,645 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2021-12-06 20:18:00,645 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2021-12-06 20:18:00,645 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse10 (= ~t1_i~0 1)) (.cse8 (= ~p_num_write~0 0)) (.cse14 (= ~m_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse36 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse37 (= ~E_1~0 1))) (let ((.cse25 (not .cse37)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse30 (not (= ~E_M~0 ~M_E~0))) (.cse31 (not (= ~m_pc~0 0))) (.cse32 (not (= ~t1_pc~0 0))) (.cse33 (and .cse12 .cse35 (= ~t1_st~0 0) .cse36)) (.cse28 (not (= ~token~0 ~local~0))) (.cse26 (= ~m_st~0 0)) (.cse1 (not (= ~M_E~0 2))) (.cse9 (<= 1 ~t1_pc~0)) (.cse24 (not (= ~T1_E~0 ~M_E~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not .cse15)) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not .cse14)) (.cse6 (not (= ~t1_pc~0 1))) (.cse17 (not .cse8)) (.cse18 (not .cse10)) (.cse19 (not .cse7)) (.cse20 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (not (= ~c_num_read~0 0))) (.cse22 (not .cse13)) (.cse23 (not (<= 2 ~E_M~0))) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (= ~E_1~0 0)) (.cse27 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse14 .cse15 .cse16) .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse3 .cse5 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse32 .cse21 .cse22 .cse33 .cse24 .cse25 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (not .cse26) .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse5 .cse30 .cse31 .cse17 .cse18 .cse19 .cse20 .cse32 .cse21 .cse22 (not (= ~E_1~0 ~M_E~0)) .cse33 .cse24 (not .cse3) .cse27 .cse28) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse35 .cse14 .cse36 .cse15) .cse0 .cse1 .cse2 .cse3 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse35 .cse14 .cse36 .cse15) .cse5 .cse37 .cse6 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (< ~local~0 ~token~0)) .cse24 .cse34 .cse27 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse37 .cse6 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse11 .cse12 .cse35 .cse36) .cse34 .cse27)))) [2021-12-06 20:18:00,645 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2021-12-06 20:18:00,645 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2021-12-06 20:18:00,645 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2021-12-06 20:18:00,645 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,645 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,645 INFO L854 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2021-12-06 20:18:00,645 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse12 (not (= ~E_1~0 1))) (.cse13 (not (= ~E_1~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< ~local~0 ~token~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~E_1~0 ~M_E~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) .cse11 .cse14 (= ~m_pc~0 0) .cse15 .cse16))) [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-12-06 20:18:00,646 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,646 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2021-12-06 20:18:00,647 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_dw_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0) .cse14))) [2021-12-06 20:18:00,647 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-12-06 20:18:00,647 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-12-06 20:18:00,647 INFO L858 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2021-12-06 20:18:00,647 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,647 INFO L854 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse5 (= ~m_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (= ~T1_E~0 ~M_E~0) .cse1 (= ~E_1~0 ~M_E~0) .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 (not .cse5) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) .cse9 .cse10))) [2021-12-06 20:18:00,647 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,647 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~p_dw_st~0) .cse11))) [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse18 (<= 1 ~t1_pc~0)) (.cse12 (= ~T1_E~0 ~M_E~0)) (.cse14 (= ~t1_pc~0 0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse11 (= ~M_E~0 2))) (let ((.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse10 (or (and .cse12 .cse18 .cse15 .cse16 .cse17 .cse11) (and .cse12 .cse14 .cse15 .cse16 .cse17 .cse11))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_free~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 (< ~local~0 ~token~0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 0) .cse9 .cse11 (let ((.cse13 (= ~E_1~0 ~M_E~0))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse12 .cse18 .cse13 .cse15 .cse16 .cse17))))))) [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2021-12-06 20:18:00,648 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,649 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,649 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-12-06 20:18:00,649 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~c_dr_st~0 2)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 0) .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8 .cse9 .cse10))) [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0))) (let ((.cse5 (= ~t1_pc~0 0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (not .cse8)) (.cse22 (not (= ~E_1~0 1))) (.cse23 (not (= ~E_1~0 0))) (.cse17 (= ~token~0 ~local~0)) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse15 (< ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse25 .cse22 .cse23 .cse13 .cse15 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse18)))) [2021-12-06 20:18:00,649 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) .cse15) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 (= ~p_num_write~0 1) .cse8 .cse9))) [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2021-12-06 20:18:00,650 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2021-12-06 20:18:00,651 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2021-12-06 20:18:00,651 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~c_dr_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,652 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 20:18:00,652 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,653 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-12-06 20:18:00,653 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2021-12-06 20:18:00,653 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L858 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,653 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-12-06 20:18:00,653 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 0)) (.cse14 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse16 (= ~c_num_read~0 0)) (.cse4 (= ~t1_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse4 .cse5 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse19 .cse8 .cse10 .cse11 .cse13 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse13 .cse12))) [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_M~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~E_M~0 ~M_E~0) .cse18 .cse19))) [2021-12-06 20:18:00,654 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~T1_E~0 ~M_E~0) (= ~p_num_write~0 0) (= ~E_1~0 ~M_E~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 20:18:00,654 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~E_1~0 1)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= ~E_M~0 ~M_E~0) .cse14 .cse15))) [2021-12-06 20:18:00,654 INFO L858 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2021-12-06 20:18:00,654 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-12-06 20:18:00,654 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2021-12-06 20:18:00,655 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 (= ~q_free~0 0) .cse7 .cse8 .cse10 .cse11 .cse12))) [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L861 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2021-12-06 20:18:00,655 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-12-06 20:18:00,655 INFO L854 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0))) (let ((.cse5 (= ~E_1~0 1)) (.cse17 (= ~E_1~0 0)) (.cse20 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse13 (not (<= 2 ~E_M~0))) (.cse21 (not .cse4)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse22 (not (= ~E_M~0 ~M_E~0))) (.cse24 (not (= ~m_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse25 (not (= ~E_1~0 ~M_E~0))) (.cse14 (not (= ~T1_E~0 ~M_E~0))) (.cse15 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse16 (not (= ~t1_st~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (< ~local~0 ~token~0)) .cse14 .cse21 .cse15 .cse17 .cse18 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse21 .cse15 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse24 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2021-12-06 20:18:00,656 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse11 (= ~m_st~0 0)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse11) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse12 (not (= ~token~0 ~local~0))) (or .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse11 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~M_E~0 |old(~M_E~0)|) .cse0 (= ~E_M~0 |old(~E_M~0)|) .cse1) .cse10 (not (<= 2 |old(~E_M~0)|)) (= |old(~E_1~0)| 1) (= |old(~E_1~0)| 0) .cse12))) [2021-12-06 20:18:00,657 INFO L858 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2021-12-06 20:18:00,659 INFO L732 BasicCegarLoop]: Path program histogram: [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-12-06 20:18:00,660 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:18:00,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:18:00 BoogieIcfgContainer [2021-12-06 20:18:00,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:18:00,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:18:00,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:18:00,716 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:18:00,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:13:46" (3/4) ... [2021-12-06 20:18:00,718 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 20:18:00,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-06 20:18:00,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-06 20:18:00,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-06 20:18:00,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-12-06 20:18:00,732 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-06 20:18:00,733 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 20:18:00,733 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 20:18:00,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-12-06 20:18:00,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) [2021-12-06 20:18:00,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) [2021-12-06 20:18:00,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(T1_E == M_E)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || ((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-12-06 20:18:00,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2021-12-06 20:18:00,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) [2021-12-06 20:18:00,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2021-12-06 20:18:00,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2021-12-06 20:18:00,799 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:18:00,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:18:00,799 INFO L158 Benchmark]: Toolchain (without parser) took 255563.29ms. Allocated memory was 79.7MB in the beginning and 916.5MB in the end (delta: 836.8MB). Free memory was 42.9MB in the beginning and 608.0MB in the end (delta: -565.1MB). Peak memory consumption was 273.5MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,799 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:18:00,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.26ms. Allocated memory was 79.7MB in the beginning and 134.2MB in the end (delta: 54.5MB). Free memory was 42.7MB in the beginning and 108.5MB in the end (delta: -65.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.07ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 105.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,800 INFO L158 Benchmark]: Boogie Preprocessor took 35.75ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 103.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,800 INFO L158 Benchmark]: RCFGBuilder took 453.51ms. Allocated memory is still 134.2MB. Free memory was 103.6MB in the beginning and 82.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,800 INFO L158 Benchmark]: TraceAbstraction took 254707.57ms. Allocated memory was 134.2MB in the beginning and 916.5MB in the end (delta: 782.2MB). Free memory was 82.6MB in the beginning and 621.6MB in the end (delta: -539.1MB). Peak memory consumption was 541.8MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,800 INFO L158 Benchmark]: Witness Printer took 83.28ms. Allocated memory is still 916.5MB. Free memory was 621.6MB in the beginning and 608.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 20:18:00,801 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.17ms. Allocated memory is still 79.7MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.26ms. Allocated memory was 79.7MB in the beginning and 134.2MB in the end (delta: 54.5MB). Free memory was 42.7MB in the beginning and 108.5MB in the end (delta: -65.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.07ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 105.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.75ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 103.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.51ms. Allocated memory is still 134.2MB. Free memory was 103.6MB in the beginning and 82.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 254707.57ms. Allocated memory was 134.2MB in the beginning and 916.5MB in the end (delta: 782.2MB). Free memory was 82.6MB in the beginning and 621.6MB in the end (delta: -539.1MB). Peak memory consumption was 541.8MB. Max. memory is 16.1GB. * Witness Printer took 83.28ms. Allocated memory is still 916.5MB. Free memory was 621.6MB in the beginning and 608.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 10 procedures, 179 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 254.6s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 235.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11642 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11340 mSDsluCounter, 19773 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12615 mSDsCounter, 2326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9024 IncrementalHoareTripleChecker+Invalid, 11350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2326 mSolverCounterUnsat, 7158 mSDtfsCounter, 9024 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1582 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7140occurred in iteration=26, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 6991 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 8850 PreInvPairs, 9220 NumberOfFragments, 10225 HoareAnnotationTreeSize, 8850 FomulaSimplifications, 2818 FormulaSimplificationTreeSizeReduction, 224.2s HoareSimplificationTime, 72 FomulaSimplificationsInter, 18988461 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3523 NumberOfCodeBlocks, 3523 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3620 ConstructedInterpolants, 0 QuantifiedInterpolants, 7035 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3203 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 40 InterpolantComputations, 29 PerfectInterpolantSequences, 1590/1700 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 2 specifications checked. All of them hold - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && local < token) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_last_read == p_last_write) && ((((((T1_E == M_E && 1 <= t1_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) || (((((T1_E == M_E && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2)))) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && 1 <= tmp) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) && ((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) || (((((T1_E == M_E && 1 <= t1_pc) && E_1 == M_E) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && M_E == 2) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) && M_E == 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(M_E == 2) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((!(M_E == 2) || (((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) && (((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((!(M_E == 2) || !(2 == \old(c_dr_st))) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((((((((((!(2 <= \old(p_dw_st)) || !(M_E == 2)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(E_1 == M_E)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(E_1 == 1)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || (((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || ((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(T1_E == M_E)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || E_1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local)) && ((((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(E_M == M_E)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(m_st == 0)) || 1 <= __retres1) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || 1 <= __retres1) || !(t1_st == 0)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2)) || ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || ((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && c_num_read == p_num_write) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((T1_E == M_E && E_1 == M_E) && t1_pc == 0) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_st == 0) && q_free == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && 2 <= p_dw_st) && M_E == 2) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && M_E == 2)) || (((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || !(T1_E == M_E)) || (((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && __retres1 <= 0) && m_i == 1) && 0 <= __retres1) && c_dr_pc == 0) && c_last_read == p_last_write) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || E_1 == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_dr_pc == 0)) || !(m_i == 1)) || !(E_M == M_E)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((m_st == \old(m_st) && __retres1 <= 0) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_1 == M_E)) || !(T1_E == M_E)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || E_1 == 0) || !(c_last_read == p_last_write))) && (((((((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || ((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && 1 <= t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && m_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(T1_E == M_E)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && T1_E == M_E) && p_num_write == 0) && E_1 == M_E) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) RESULT: Ultimate proved your program to be correct! [2021-12-06 20:18:00,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77c70e0e-f7b3-4d94-a623-00cdc86a9f3b/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE