./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be --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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:35:54,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:35:54,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:35:54,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:35:54,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:35:54,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:35:54,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:35:54,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:35:54,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:35:54,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:35:54,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:35:54,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:35:54,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:35:54,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:35:54,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:35:54,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:35:54,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:35:54,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:35:54,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:35:54,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:35:54,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:35:54,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:35:54,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:35:54,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:35:54,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:35:54,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:35:54,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:35:54,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:35:54,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:35:54,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:35:54,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:35:54,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:35:54,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:35:54,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:35:54,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:35:54,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:35:54,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:35:54,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:35:54,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:35:54,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:35:54,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:35:54,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:35:54,643 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:35:54,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:35:54,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:35:54,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:35:54,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:35:54,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:35:54,653 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:35:54,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:35:54,654 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:35:54,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:35:54,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:35:54,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:35:54,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:35:54,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:35:54,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:35:54,656 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:35:54,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:35:54,657 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:35:54,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:35:54,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:35:54,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:35:54,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:35:54,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:35:54,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:35:54,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:35:54,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:35:54,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:35:54,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:35:54,659 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:35:54,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:35:54,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:35:54,661 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:35:54,662 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_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/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_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2021-10-21 19:35:54,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:35:54,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:35:54,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:35:54,973 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:35:54,974 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:35:54,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-21 19:35:55,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/data/32fe6667a/9cc6fb84dd7c4ab4bf01c81f069e4e3f/FLAGc00fbc726 [2021-10-21 19:35:55,637 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:35:55,638 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-21 19:35:55,648 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/data/32fe6667a/9cc6fb84dd7c4ab4bf01c81f069e4e3f/FLAGc00fbc726 [2021-10-21 19:35:55,933 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/data/32fe6667a/9cc6fb84dd7c4ab4bf01c81f069e4e3f [2021-10-21 19:35:55,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:35:55,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:35:55,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:35:55,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:35:55,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:35:55,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f01f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55, skipping insertion in model container [2021-10-21 19:35:55,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:35:55,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:35:56,238 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-10-21 19:35:56,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:35:56,256 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:35:56,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-10-21 19:35:56,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:35:56,337 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:35:56,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56 WrapperNode [2021-10-21 19:35:56,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:35:56,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:35:56,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:35:56,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:35:56,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:35:56,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:35:56,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:35:56,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:35:56,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:35:56,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:35:56,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:35:56,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:35:56,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (1/1) ... [2021-10-21 19:35:56,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:35:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:56,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:56,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:35:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:35:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:35:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:35:56,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:35:58,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:35:58,165 INFO L299 CfgBuilder]: Removed 183 assume(true) statements. [2021-10-21 19:35:58,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:35:58 BoogieIcfgContainer [2021-10-21 19:35:58,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:35:58,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:35:58,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:35:58,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:35:58,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:35:55" (1/3) ... [2021-10-21 19:35:58,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:35:58, skipping insertion in model container [2021-10-21 19:35:58,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:56" (2/3) ... [2021-10-21 19:35:58,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:35:58, skipping insertion in model container [2021-10-21 19:35:58,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:35:58" (3/3) ... [2021-10-21 19:35:58,180 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-10-21 19:35:58,188 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:35:58,188 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2021-10-21 19:35:58,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:35:58,254 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-10-21 19:35:58,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-10-21 19:35:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-21 19:35:58,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:58,292 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:58,292 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2021-10-21 19:35:58,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:58,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633823365] [2021-10-21 19:35:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:58,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:58,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:58,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633823365] [2021-10-21 19:35:58,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633823365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:58,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:58,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:35:58,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391119181] [2021-10-21 19:35:58,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:35:58,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:35:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:58,521 INFO L87 Difference]: Start difference. First operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:58,807 INFO L93 Difference]: Finished difference Result 1245 states and 2060 transitions. [2021-10-21 19:35:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:35:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-21 19:35:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:35:58,832 INFO L225 Difference]: With dead ends: 1245 [2021-10-21 19:35:58,832 INFO L226 Difference]: Without dead ends: 726 [2021-10-21 19:35:58,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-10-21 19:35:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 457. [2021-10-21 19:35:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.6713615023474178) internal successors, (712), 456 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 712 transitions. [2021-10-21 19:35:58,915 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 712 transitions. Word has length 9 [2021-10-21 19:35:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:35:58,915 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 712 transitions. [2021-10-21 19:35:58,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 712 transitions. [2021-10-21 19:35:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-21 19:35:58,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:58,917 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:58,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:35:58,918 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2021-10-21 19:35:58,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:58,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185927925] [2021-10-21 19:35:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:58,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:58,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:58,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185927925] [2021-10-21 19:35:58,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185927925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:58,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:58,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:35:58,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130141085] [2021-10-21 19:35:58,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:35:58,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:35:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:58,997 INFO L87 Difference]: Start difference. First operand 457 states and 712 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:59,091 INFO L93 Difference]: Finished difference Result 1131 states and 1746 transitions. [2021-10-21 19:35:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:35:59,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-21 19:35:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:35:59,097 INFO L225 Difference]: With dead ends: 1131 [2021-10-21 19:35:59,098 INFO L226 Difference]: Without dead ends: 676 [2021-10-21 19:35:59,104 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-21 19:35:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 424. [2021-10-21 19:35:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 396 states have (on average 1.6515151515151516) internal successors, (654), 423 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 654 transitions. [2021-10-21 19:35:59,150 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 654 transitions. Word has length 10 [2021-10-21 19:35:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:35:59,150 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 654 transitions. [2021-10-21 19:35:59,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 654 transitions. [2021-10-21 19:35:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-21 19:35:59,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:59,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:59,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:35:59,155 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash -248055967, now seen corresponding path program 1 times [2021-10-21 19:35:59,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220193936] [2021-10-21 19:35:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220193936] [2021-10-21 19:35:59,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220193936] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:59,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:59,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:35:59,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001156144] [2021-10-21 19:35:59,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:35:59,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:35:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:59,212 INFO L87 Difference]: Start difference. First operand 424 states and 654 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:59,275 INFO L93 Difference]: Finished difference Result 1250 states and 1933 transitions. [2021-10-21 19:35:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:35:59,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-21 19:35:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:35:59,282 INFO L225 Difference]: With dead ends: 1250 [2021-10-21 19:35:59,282 INFO L226 Difference]: Without dead ends: 836 [2021-10-21 19:35:59,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-10-21 19:35:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 428. [2021-10-21 19:35:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.645) internal successors, (658), 427 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 658 transitions. [2021-10-21 19:35:59,306 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 658 transitions. Word has length 14 [2021-10-21 19:35:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:35:59,307 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 658 transitions. [2021-10-21 19:35:59,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 658 transitions. [2021-10-21 19:35:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 19:35:59,312 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:59,312 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:59,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:35:59,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2021-10-21 19:35:59,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411340899] [2021-10-21 19:35:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411340899] [2021-10-21 19:35:59,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411340899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:59,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:59,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:35:59,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517812571] [2021-10-21 19:35:59,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:35:59,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:59,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:35:59,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:35:59,420 INFO L87 Difference]: Start difference. First operand 428 states and 658 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:59,507 INFO L93 Difference]: Finished difference Result 1579 states and 2407 transitions. [2021-10-21 19:35:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:35:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-21 19:35:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:35:59,515 INFO L225 Difference]: With dead ends: 1579 [2021-10-21 19:35:59,515 INFO L226 Difference]: Without dead ends: 1165 [2021-10-21 19:35:59,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:35:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-10-21 19:35:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 430. [2021-10-21 19:35:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 402 states have (on average 1.6417910447761195) internal successors, (660), 429 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 660 transitions. [2021-10-21 19:35:59,539 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 660 transitions. Word has length 18 [2021-10-21 19:35:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:35:59,539 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 660 transitions. [2021-10-21 19:35:59,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 660 transitions. [2021-10-21 19:35:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:35:59,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:59,542 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:59,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:35:59,543 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1707916525, now seen corresponding path program 1 times [2021-10-21 19:35:59,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755633749] [2021-10-21 19:35:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755633749] [2021-10-21 19:35:59,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755633749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:59,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:59,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:35:59,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917144391] [2021-10-21 19:35:59,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:35:59,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:59,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:35:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:35:59,635 INFO L87 Difference]: Start difference. First operand 430 states and 660 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:59,673 INFO L93 Difference]: Finished difference Result 673 states and 1026 transitions. [2021-10-21 19:35:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:35:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-21 19:35:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:35:59,676 INFO L225 Difference]: With dead ends: 673 [2021-10-21 19:35:59,676 INFO L226 Difference]: Without dead ends: 428 [2021-10-21 19:35:59,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:35:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-21 19:35:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-10-21 19:35:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.6325) internal successors, (653), 427 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 653 transitions. [2021-10-21 19:35:59,691 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 653 transitions. Word has length 19 [2021-10-21 19:35:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:35:59,692 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 653 transitions. [2021-10-21 19:35:59,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 653 transitions. [2021-10-21 19:35:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 19:35:59,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:35:59,693 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:35:59,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:35:59,694 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:35:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2021-10-21 19:35:59,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304998907] [2021-10-21 19:35:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304998907] [2021-10-21 19:35:59,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304998907] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:35:59,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000048782] [2021-10-21 19:35:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:35:59,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:59,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:35:59,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:35:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-21 19:35:59,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:35:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000048782] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:35:59,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:35:59,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-21 19:35:59,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792797765] [2021-10-21 19:36:00,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:36:00,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:00,017 INFO L87 Difference]: Start difference. First operand 428 states and 653 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,142 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2021-10-21 19:36:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-21 19:36:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:00,150 INFO L225 Difference]: With dead ends: 1667 [2021-10-21 19:36:00,150 INFO L226 Difference]: Without dead ends: 1250 [2021-10-21 19:36:00,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-10-21 19:36:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 574. [2021-10-21 19:36:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 546 states have (on average 1.6538461538461537) internal successors, (903), 573 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 903 transitions. [2021-10-21 19:36:00,180 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 903 transitions. Word has length 21 [2021-10-21 19:36:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:00,180 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 903 transitions. [2021-10-21 19:36:00,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 903 transitions. [2021-10-21 19:36:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-21 19:36:00,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:00,182 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:00,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:00,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-21 19:36:00,395 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1165168607, now seen corresponding path program 2 times [2021-10-21 19:36:00,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627666206] [2021-10-21 19:36:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-21 19:36:00,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627666206] [2021-10-21 19:36:00,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627666206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:00,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:00,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:00,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50016795] [2021-10-21 19:36:00,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:00,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:00,457 INFO L87 Difference]: Start difference. First operand 574 states and 903 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,556 INFO L93 Difference]: Finished difference Result 1297 states and 2010 transitions. [2021-10-21 19:36:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-21 19:36:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:00,563 INFO L225 Difference]: With dead ends: 1297 [2021-10-21 19:36:00,563 INFO L226 Difference]: Without dead ends: 781 [2021-10-21 19:36:00,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-10-21 19:36:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 508. [2021-10-21 19:36:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.6041237113402063) internal successors, (778), 507 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 778 transitions. [2021-10-21 19:36:00,587 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 778 transitions. Word has length 28 [2021-10-21 19:36:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:00,588 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 778 transitions. [2021-10-21 19:36:00,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 778 transitions. [2021-10-21 19:36:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-21 19:36:00,589 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:00,589 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:00,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:36:00,590 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 777427029, now seen corresponding path program 1 times [2021-10-21 19:36:00,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301851508] [2021-10-21 19:36:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-21 19:36:00,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301851508] [2021-10-21 19:36:00,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301851508] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:00,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:00,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:00,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79648668] [2021-10-21 19:36:00,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:00,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:00,657 INFO L87 Difference]: Start difference. First operand 508 states and 778 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,713 INFO L93 Difference]: Finished difference Result 1165 states and 1769 transitions. [2021-10-21 19:36:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-21 19:36:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:00,718 INFO L225 Difference]: With dead ends: 1165 [2021-10-21 19:36:00,718 INFO L226 Difference]: Without dead ends: 688 [2021-10-21 19:36:00,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-21 19:36:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 457. [2021-10-21 19:36:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5688073394495412) internal successors, (684), 456 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 684 transitions. [2021-10-21 19:36:00,756 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 684 transitions. Word has length 28 [2021-10-21 19:36:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:00,757 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 684 transitions. [2021-10-21 19:36:00,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 684 transitions. [2021-10-21 19:36:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:36:00,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:00,761 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:00,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:36:00,761 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 104948594, now seen corresponding path program 1 times [2021-10-21 19:36:00,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187465484] [2021-10-21 19:36:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-21 19:36:00,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187465484] [2021-10-21 19:36:00,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187465484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:00,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:00,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:00,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385229076] [2021-10-21 19:36:00,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:00,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:00,843 INFO L87 Difference]: Start difference. First operand 457 states and 684 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,902 INFO L93 Difference]: Finished difference Result 1099 states and 1650 transitions. [2021-10-21 19:36:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:00,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-21 19:36:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:00,909 INFO L225 Difference]: With dead ends: 1099 [2021-10-21 19:36:00,909 INFO L226 Difference]: Without dead ends: 686 [2021-10-21 19:36:00,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-21 19:36:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 457. [2021-10-21 19:36:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5642201834862386) internal successors, (682), 456 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 682 transitions. [2021-10-21 19:36:00,928 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 682 transitions. Word has length 38 [2021-10-21 19:36:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:00,928 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 682 transitions. [2021-10-21 19:36:00,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 682 transitions. [2021-10-21 19:36:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 19:36:00,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:00,930 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 19:36:00,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:36:00,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1338937392, now seen corresponding path program 1 times [2021-10-21 19:36:00,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106297756] [2021-10-21 19:36:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:36:01,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106297756] [2021-10-21 19:36:01,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106297756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753767455] [2021-10-21 19:36:01,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,006 INFO L87 Difference]: Start difference. First operand 457 states and 682 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,053 INFO L93 Difference]: Finished difference Result 1035 states and 1549 transitions. [2021-10-21 19:36:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 19:36:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,059 INFO L225 Difference]: With dead ends: 1035 [2021-10-21 19:36:01,059 INFO L226 Difference]: Without dead ends: 641 [2021-10-21 19:36:01,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-10-21 19:36:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 413. [2021-10-21 19:36:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 393 states have (on average 1.5470737913486006) internal successors, (608), 412 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 608 transitions. [2021-10-21 19:36:01,077 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 608 transitions. Word has length 50 [2021-10-21 19:36:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,079 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 608 transitions. [2021-10-21 19:36:01,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2021-10-21 19:36:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-21 19:36:01,081 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,081 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 19:36:01,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:36:01,081 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 970476669, now seen corresponding path program 1 times [2021-10-21 19:36:01,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750311807] [2021-10-21 19:36:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:36:01,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750311807] [2021-10-21 19:36:01,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750311807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698196412] [2021-10-21 19:36:01,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,152 INFO L87 Difference]: Start difference. First operand 413 states and 608 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,212 INFO L93 Difference]: Finished difference Result 869 states and 1278 transitions. [2021-10-21 19:36:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-21 19:36:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,216 INFO L225 Difference]: With dead ends: 869 [2021-10-21 19:36:01,216 INFO L226 Difference]: Without dead ends: 511 [2021-10-21 19:36:01,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-10-21 19:36:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2021-10-21 19:36:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4730878186968839) internal successors, (520), 368 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 520 transitions. [2021-10-21 19:36:01,232 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 520 transitions. Word has length 51 [2021-10-21 19:36:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,233 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 520 transitions. [2021-10-21 19:36:01,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 520 transitions. [2021-10-21 19:36:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-21 19:36:01,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,234 INFO L512 BasicCegarLoop]: trace histogram [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-10-21 19:36:01,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:36:01,235 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,235 INFO L82 PathProgramCache]: Analyzing trace with hash 216341264, now seen corresponding path program 1 times [2021-10-21 19:36:01,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544187652] [2021-10-21 19:36:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:36:01,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544187652] [2021-10-21 19:36:01,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544187652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:01,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874435879] [2021-10-21 19:36:01,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:01,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:01,299 INFO L87 Difference]: Start difference. First operand 369 states and 520 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,346 INFO L93 Difference]: Finished difference Result 877 states and 1257 transitions. [2021-10-21 19:36:01,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-21 19:36:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,353 INFO L225 Difference]: With dead ends: 877 [2021-10-21 19:36:01,353 INFO L226 Difference]: Without dead ends: 580 [2021-10-21 19:36:01,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-21 19:36:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 369. [2021-10-21 19:36:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4674220963172804) internal successors, (518), 368 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 518 transitions. [2021-10-21 19:36:01,384 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 518 transitions. Word has length 62 [2021-10-21 19:36:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,385 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 518 transitions. [2021-10-21 19:36:01,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 518 transitions. [2021-10-21 19:36:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-21 19:36:01,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,386 INFO L512 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, 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] [2021-10-21 19:36:01,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:36:01,387 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash 542276843, now seen corresponding path program 1 times [2021-10-21 19:36:01,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442623595] [2021-10-21 19:36:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-21 19:36:01,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442623595] [2021-10-21 19:36:01,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442623595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648905811] [2021-10-21 19:36:01,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,440 INFO L87 Difference]: Start difference. First operand 369 states and 518 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,485 INFO L93 Difference]: Finished difference Result 728 states and 1056 transitions. [2021-10-21 19:36:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-10-21 19:36:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,488 INFO L225 Difference]: With dead ends: 728 [2021-10-21 19:36:01,489 INFO L226 Difference]: Without dead ends: 465 [2021-10-21 19:36:01,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-10-21 19:36:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 327. [2021-10-21 19:36:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 321 states have (on average 1.4454828660436136) internal successors, (464), 326 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 464 transitions. [2021-10-21 19:36:01,506 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 464 transitions. Word has length 76 [2021-10-21 19:36:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,506 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 464 transitions. [2021-10-21 19:36:01,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 464 transitions. [2021-10-21 19:36:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-21 19:36:01,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,508 INFO L512 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, 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] [2021-10-21 19:36:01,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:36:01,508 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash -532838176, now seen corresponding path program 1 times [2021-10-21 19:36:01,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898201582] [2021-10-21 19:36:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-21 19:36:01,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898201582] [2021-10-21 19:36:01,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898201582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133369156] [2021-10-21 19:36:01,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,571 INFO L87 Difference]: Start difference. First operand 327 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,600 INFO L93 Difference]: Finished difference Result 516 states and 747 transitions. [2021-10-21 19:36:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-10-21 19:36:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,603 INFO L225 Difference]: With dead ends: 516 [2021-10-21 19:36:01,603 INFO L226 Difference]: Without dead ends: 273 [2021-10-21 19:36:01,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-21 19:36:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-21 19:36:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4269662921348314) internal successors, (381), 272 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 381 transitions. [2021-10-21 19:36:01,615 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 381 transitions. Word has length 85 [2021-10-21 19:36:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,616 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 381 transitions. [2021-10-21 19:36:01,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 381 transitions. [2021-10-21 19:36:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-21 19:36:01,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,623 INFO L512 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, 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] [2021-10-21 19:36:01,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:36:01,623 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1722161102, now seen corresponding path program 1 times [2021-10-21 19:36:01,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920949176] [2021-10-21 19:36:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-21 19:36:01,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920949176] [2021-10-21 19:36:01,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920949176] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:01,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621271307] [2021-10-21 19:36:01,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:01,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:01,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:01,690 INFO L87 Difference]: Start difference. First operand 273 states and 381 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,720 INFO L93 Difference]: Finished difference Result 448 states and 642 transitions. [2021-10-21 19:36:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:01,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-21 19:36:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,722 INFO L225 Difference]: With dead ends: 448 [2021-10-21 19:36:01,722 INFO L226 Difference]: Without dead ends: 273 [2021-10-21 19:36:01,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-21 19:36:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-10-21 19:36:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4194756554307115) internal successors, (379), 272 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 379 transitions. [2021-10-21 19:36:01,735 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 379 transitions. Word has length 88 [2021-10-21 19:36:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,735 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 379 transitions. [2021-10-21 19:36:01,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 379 transitions. [2021-10-21 19:36:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-21 19:36:01,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,737 INFO L512 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, 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] [2021-10-21 19:36:01,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:36:01,737 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash 621115599, now seen corresponding path program 1 times [2021-10-21 19:36:01,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899686054] [2021-10-21 19:36:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-21 19:36:01,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899686054] [2021-10-21 19:36:01,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899686054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136280837] [2021-10-21 19:36:01,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,790 INFO L87 Difference]: Start difference. First operand 273 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,819 INFO L93 Difference]: Finished difference Result 579 states and 841 transitions. [2021-10-21 19:36:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-21 19:36:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,822 INFO L225 Difference]: With dead ends: 579 [2021-10-21 19:36:01,822 INFO L226 Difference]: Without dead ends: 409 [2021-10-21 19:36:01,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-21 19:36:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2021-10-21 19:36:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4106463878326996) internal successors, (371), 267 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 371 transitions. [2021-10-21 19:36:01,836 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 371 transitions. Word has length 101 [2021-10-21 19:36:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,836 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 371 transitions. [2021-10-21 19:36:01,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 371 transitions. [2021-10-21 19:36:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-21 19:36:01,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,838 INFO L512 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, 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] [2021-10-21 19:36:01,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:36:01,839 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2032967497, now seen corresponding path program 1 times [2021-10-21 19:36:01,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515969115] [2021-10-21 19:36:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-21 19:36:01,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515969115] [2021-10-21 19:36:01,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515969115] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:01,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630609775] [2021-10-21 19:36:01,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:01,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:01,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,905 INFO L87 Difference]: Start difference. First operand 268 states and 371 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,934 INFO L93 Difference]: Finished difference Result 559 states and 811 transitions. [2021-10-21 19:36:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:01,935 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-10-21 19:36:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:01,938 INFO L225 Difference]: With dead ends: 559 [2021-10-21 19:36:01,938 INFO L226 Difference]: Without dead ends: 394 [2021-10-21 19:36:01,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-21 19:36:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 264. [2021-10-21 19:36:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 260 states have (on average 1.4) internal successors, (364), 263 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 364 transitions. [2021-10-21 19:36:01,953 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 364 transitions. Word has length 106 [2021-10-21 19:36:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:01,953 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 364 transitions. [2021-10-21 19:36:01,953 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2021-10-21 19:36:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-21 19:36:01,954 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:01,955 INFO L512 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, 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] [2021-10-21 19:36:01,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:36:01,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1082553381, now seen corresponding path program 1 times [2021-10-21 19:36:01,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466618291] [2021-10-21 19:36:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-21 19:36:02,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:02,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466618291] [2021-10-21 19:36:02,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466618291] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:02,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:02,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:02,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315200852] [2021-10-21 19:36:02,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:02,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:02,016 INFO L87 Difference]: Start difference. First operand 264 states and 364 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:02,036 INFO L93 Difference]: Finished difference Result 423 states and 603 transitions. [2021-10-21 19:36:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-10-21 19:36:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:02,038 INFO L225 Difference]: With dead ends: 423 [2021-10-21 19:36:02,038 INFO L226 Difference]: Without dead ends: 262 [2021-10-21 19:36:02,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-21 19:36:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-10-21 19:36:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 258 states have (on average 1.3875968992248062) internal successors, (358), 260 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 358 transitions. [2021-10-21 19:36:02,050 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 358 transitions. Word has length 112 [2021-10-21 19:36:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:02,050 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 358 transitions. [2021-10-21 19:36:02,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 358 transitions. [2021-10-21 19:36:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-21 19:36:02,058 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:02,058 INFO L512 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, 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-10-21 19:36:02,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:36:02,058 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1802895144, now seen corresponding path program 1 times [2021-10-21 19:36:02,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:02,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364440775] [2021-10-21 19:36:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:02,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-21 19:36:02,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:02,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364440775] [2021-10-21 19:36:02,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364440775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:02,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:02,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:02,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862757667] [2021-10-21 19:36:02,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:02,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:02,113 INFO L87 Difference]: Start difference. First operand 261 states and 358 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:02,126 INFO L93 Difference]: Finished difference Result 468 states and 665 transitions. [2021-10-21 19:36:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-10-21 19:36:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:02,128 INFO L225 Difference]: With dead ends: 468 [2021-10-21 19:36:02,129 INFO L226 Difference]: Without dead ends: 310 [2021-10-21 19:36:02,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-21 19:36:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 258. [2021-10-21 19:36:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 1.3828125) internal successors, (354), 257 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2021-10-21 19:36:02,141 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 119 [2021-10-21 19:36:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:02,142 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2021-10-21 19:36:02,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2021-10-21 19:36:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-21 19:36:02,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:02,143 INFO L512 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, 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] [2021-10-21 19:36:02,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:36:02,144 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1684200321, now seen corresponding path program 1 times [2021-10-21 19:36:02,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:02,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524975181] [2021-10-21 19:36:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:02,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-21 19:36:02,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:02,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524975181] [2021-10-21 19:36:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524975181] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:02,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972662948] [2021-10-21 19:36:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:02,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:02,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:02,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:02,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 19:36:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:02,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:36:02,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-21 19:36:02,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972662948] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:02,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:02,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-21 19:36:02,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480519052] [2021-10-21 19:36:02,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:36:02,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:36:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:02,713 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:02,787 INFO L93 Difference]: Finished difference Result 538 states and 737 transitions. [2021-10-21 19:36:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:02,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-10-21 19:36:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:02,790 INFO L225 Difference]: With dead ends: 538 [2021-10-21 19:36:02,790 INFO L226 Difference]: Without dead ends: 299 [2021-10-21 19:36:02,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-21 19:36:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-21 19:36:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.3569023569023568) internal successors, (403), 298 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2021-10-21 19:36:02,804 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 122 [2021-10-21 19:36:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:02,805 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2021-10-21 19:36:02,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2021-10-21 19:36:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-21 19:36:02,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:02,807 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:02,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:03,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:03,035 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1291870858, now seen corresponding path program 2 times [2021-10-21 19:36:03,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:03,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511175028] [2021-10-21 19:36:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:03,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:03,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:03,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511175028] [2021-10-21 19:36:03,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511175028] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:03,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:03,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:03,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795057235] [2021-10-21 19:36:03,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:03,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:03,139 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:03,223 INFO L93 Difference]: Finished difference Result 636 states and 897 transitions. [2021-10-21 19:36:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-10-21 19:36:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:03,227 INFO L225 Difference]: With dead ends: 636 [2021-10-21 19:36:03,227 INFO L226 Difference]: Without dead ends: 481 [2021-10-21 19:36:03,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-21 19:36:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 385. [2021-10-21 19:36:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 383 states have (on average 1.370757180156658) internal successors, (525), 384 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 525 transitions. [2021-10-21 19:36:03,247 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 525 transitions. Word has length 159 [2021-10-21 19:36:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:03,248 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 525 transitions. [2021-10-21 19:36:03,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2021-10-21 19:36:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-21 19:36:03,250 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:03,250 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:03,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:36:03,251 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1937549472, now seen corresponding path program 1 times [2021-10-21 19:36:03,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:03,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952375130] [2021-10-21 19:36:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:03,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:03,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:03,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952375130] [2021-10-21 19:36:03,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952375130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:03,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:03,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:03,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860575770] [2021-10-21 19:36:03,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:03,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,342 INFO L87 Difference]: Start difference. First operand 385 states and 525 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:03,382 INFO L93 Difference]: Finished difference Result 799 states and 1134 transitions. [2021-10-21 19:36:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-10-21 19:36:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:03,386 INFO L225 Difference]: With dead ends: 799 [2021-10-21 19:36:03,386 INFO L226 Difference]: Without dead ends: 599 [2021-10-21 19:36:03,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-21 19:36:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2021-10-21 19:36:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 1.37417943107221) internal successors, (628), 458 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2021-10-21 19:36:03,416 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 177 [2021-10-21 19:36:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:03,416 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2021-10-21 19:36:03,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2021-10-21 19:36:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-21 19:36:03,419 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:03,419 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:03,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 19:36:03,420 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -251982915, now seen corresponding path program 1 times [2021-10-21 19:36:03,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:03,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112143208] [2021-10-21 19:36:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:03,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:03,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:03,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112143208] [2021-10-21 19:36:03,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112143208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:03,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:03,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:03,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428777229] [2021-10-21 19:36:03,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:03,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,493 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:03,540 INFO L93 Difference]: Finished difference Result 955 states and 1354 transitions. [2021-10-21 19:36:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-10-21 19:36:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:03,545 INFO L225 Difference]: With dead ends: 955 [2021-10-21 19:36:03,545 INFO L226 Difference]: Without dead ends: 710 [2021-10-21 19:36:03,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-21 19:36:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 557. [2021-10-21 19:36:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 1.38018018018018) internal successors, (766), 556 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 766 transitions. [2021-10-21 19:36:03,583 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 766 transitions. Word has length 178 [2021-10-21 19:36:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:03,583 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 766 transitions. [2021-10-21 19:36:03,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 766 transitions. [2021-10-21 19:36:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-21 19:36:03,586 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:03,586 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:03,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:36:03,587 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1139374053, now seen corresponding path program 1 times [2021-10-21 19:36:03,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:03,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999094076] [2021-10-21 19:36:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:03,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:03,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:03,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999094076] [2021-10-21 19:36:03,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999094076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:03,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:03,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:03,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141178945] [2021-10-21 19:36:03,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:03,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,661 INFO L87 Difference]: Start difference. First operand 557 states and 766 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:03,716 INFO L93 Difference]: Finished difference Result 1135 states and 1616 transitions. [2021-10-21 19:36:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-21 19:36:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:03,722 INFO L225 Difference]: With dead ends: 1135 [2021-10-21 19:36:03,722 INFO L226 Difference]: Without dead ends: 824 [2021-10-21 19:36:03,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-10-21 19:36:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 643. [2021-10-21 19:36:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3946957878315132) internal successors, (894), 642 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2021-10-21 19:36:03,762 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 179 [2021-10-21 19:36:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:03,762 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2021-10-21 19:36:03,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2021-10-21 19:36:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-21 19:36:03,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:03,765 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:03,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:36:03,766 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash -920519335, now seen corresponding path program 1 times [2021-10-21 19:36:03,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:03,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771489929] [2021-10-21 19:36:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:03,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:03,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:03,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771489929] [2021-10-21 19:36:03,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771489929] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:03,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:03,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:03,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29088190] [2021-10-21 19:36:03,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:36:03,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:03,866 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:04,003 INFO L93 Difference]: Finished difference Result 1287 states and 1778 transitions. [2021-10-21 19:36:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:36:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-21 19:36:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:04,009 INFO L225 Difference]: With dead ends: 1287 [2021-10-21 19:36:04,009 INFO L226 Difference]: Without dead ends: 898 [2021-10-21 19:36:04,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:36:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-21 19:36:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 643. [2021-10-21 19:36:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3806552262090483) internal successors, (885), 642 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 885 transitions. [2021-10-21 19:36:04,054 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 885 transitions. Word has length 179 [2021-10-21 19:36:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:04,054 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 885 transitions. [2021-10-21 19:36:04,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 885 transitions. [2021-10-21 19:36:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-21 19:36:04,056 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:04,057 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:04,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:36:04,057 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858399, now seen corresponding path program 1 times [2021-10-21 19:36:04,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:04,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375666948] [2021-10-21 19:36:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:04,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:04,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:04,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375666948] [2021-10-21 19:36:04,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375666948] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:04,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:04,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:04,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659395097] [2021-10-21 19:36:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:36:04,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:04,140 INFO L87 Difference]: Start difference. First operand 643 states and 885 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:04,291 INFO L93 Difference]: Finished difference Result 1519 states and 2130 transitions. [2021-10-21 19:36:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:36:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-21 19:36:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:04,298 INFO L225 Difference]: With dead ends: 1519 [2021-10-21 19:36:04,299 INFO L226 Difference]: Without dead ends: 1130 [2021-10-21 19:36:04,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:36:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-10-21 19:36:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 643. [2021-10-21 19:36:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3790951638065523) internal successors, (884), 642 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 884 transitions. [2021-10-21 19:36:04,349 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 884 transitions. Word has length 180 [2021-10-21 19:36:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:04,349 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 884 transitions. [2021-10-21 19:36:04,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 884 transitions. [2021-10-21 19:36:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-10-21 19:36:04,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:04,352 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:04,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:36:04,353 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:04,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1177602269, now seen corresponding path program 1 times [2021-10-21 19:36:04,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:04,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184240480] [2021-10-21 19:36:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:04,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:04,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:04,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184240480] [2021-10-21 19:36:04,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184240480] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:04,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:04,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:36:04,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911433393] [2021-10-21 19:36:04,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:36:04,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:04,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:36:04,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:04,493 INFO L87 Difference]: Start difference. First operand 643 states and 884 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:04,644 INFO L93 Difference]: Finished difference Result 1058 states and 1477 transitions. [2021-10-21 19:36:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:36:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2021-10-21 19:36:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:04,651 INFO L225 Difference]: With dead ends: 1058 [2021-10-21 19:36:04,652 INFO L226 Difference]: Without dead ends: 1056 [2021-10-21 19:36:04,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:36:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-10-21 19:36:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 645. [2021-10-21 19:36:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.3779160186625194) internal successors, (886), 644 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2021-10-21 19:36:04,705 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 181 [2021-10-21 19:36:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:04,706 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2021-10-21 19:36:04,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2021-10-21 19:36:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-21 19:36:04,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:04,709 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:04,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:36:04,710 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1249235817, now seen corresponding path program 1 times [2021-10-21 19:36:04,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:04,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699222607] [2021-10-21 19:36:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:04,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-21 19:36:04,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:04,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699222607] [2021-10-21 19:36:04,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699222607] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:04,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122774074] [2021-10-21 19:36:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:04,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:04,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:04,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 19:36:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:05,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:36:05,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-21 19:36:05,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122774074] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:05,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:05,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-10-21 19:36:05,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294387310] [2021-10-21 19:36:05,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:36:05,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:05,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:36:05,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:36:05,611 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:06,337 INFO L93 Difference]: Finished difference Result 3897 states and 5558 transitions. [2021-10-21 19:36:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-21 19:36:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-10-21 19:36:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:06,358 INFO L225 Difference]: With dead ends: 3897 [2021-10-21 19:36:06,359 INFO L226 Difference]: Without dead ends: 3506 [2021-10-21 19:36:06,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 210.6ms TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-10-21 19:36:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2021-10-21 19:36:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 871. [2021-10-21 19:36:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3532796317606444) internal successors, (1176), 870 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1176 transitions. [2021-10-21 19:36:06,483 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1176 transitions. Word has length 184 [2021-10-21 19:36:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:06,483 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1176 transitions. [2021-10-21 19:36:06,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1176 transitions. [2021-10-21 19:36:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-21 19:36:06,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:06,487 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:06,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:06,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-10-21 19:36:06,714 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash -30627861, now seen corresponding path program 1 times [2021-10-21 19:36:06,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:06,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576009356] [2021-10-21 19:36:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:06,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:06,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:06,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576009356] [2021-10-21 19:36:06,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576009356] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:06,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:06,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:06,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125737910] [2021-10-21 19:36:06,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:06,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:06,797 INFO L87 Difference]: Start difference. First operand 871 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:06,950 INFO L93 Difference]: Finished difference Result 1949 states and 2675 transitions. [2021-10-21 19:36:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-10-21 19:36:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:06,960 INFO L225 Difference]: With dead ends: 1949 [2021-10-21 19:36:06,960 INFO L226 Difference]: Without dead ends: 1558 [2021-10-21 19:36:06,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2021-10-21 19:36:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 871. [2021-10-21 19:36:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3509781357882624) internal successors, (1174), 870 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1174 transitions. [2021-10-21 19:36:07,041 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1174 transitions. Word has length 184 [2021-10-21 19:36:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:07,041 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1174 transitions. [2021-10-21 19:36:07,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1174 transitions. [2021-10-21 19:36:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-21 19:36:07,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:07,045 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:07,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:36:07,045 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -489339443, now seen corresponding path program 1 times [2021-10-21 19:36:07,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:07,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454485621] [2021-10-21 19:36:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:07,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-10-21 19:36:07,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:07,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454485621] [2021-10-21 19:36:07,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454485621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:07,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:07,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:07,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715765569] [2021-10-21 19:36:07,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:07,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:07,098 INFO L87 Difference]: Start difference. First operand 871 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:07,196 INFO L93 Difference]: Finished difference Result 1463 states and 1989 transitions. [2021-10-21 19:36:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2021-10-21 19:36:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:07,201 INFO L225 Difference]: With dead ends: 1463 [2021-10-21 19:36:07,201 INFO L226 Difference]: Without dead ends: 713 [2021-10-21 19:36:07,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-10-21 19:36:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2021-10-21 19:36:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 710 states have (on average 1.3253521126760563) internal successors, (941), 711 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 941 transitions. [2021-10-21 19:36:07,262 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 941 transitions. Word has length 187 [2021-10-21 19:36:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:07,262 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 941 transitions. [2021-10-21 19:36:07,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 941 transitions. [2021-10-21 19:36:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-10-21 19:36:07,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:07,266 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:07,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:36:07,266 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1612175983, now seen corresponding path program 1 times [2021-10-21 19:36:07,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:07,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63250651] [2021-10-21 19:36:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:07,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:07,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:07,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63250651] [2021-10-21 19:36:07,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63250651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:07,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:07,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:36:07,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147296308] [2021-10-21 19:36:07,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:36:07,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:36:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:36:07,426 INFO L87 Difference]: Start difference. First operand 712 states and 941 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:07,747 INFO L93 Difference]: Finished difference Result 1529 states and 2049 transitions. [2021-10-21 19:36:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:36:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2021-10-21 19:36:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:07,755 INFO L225 Difference]: With dead ends: 1529 [2021-10-21 19:36:07,755 INFO L226 Difference]: Without dead ends: 1149 [2021-10-21 19:36:07,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:36:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-10-21 19:36:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 827. [2021-10-21 19:36:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.3163636363636364) internal successors, (1086), 826 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1086 transitions. [2021-10-21 19:36:07,859 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1086 transitions. Word has length 192 [2021-10-21 19:36:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:07,859 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1086 transitions. [2021-10-21 19:36:07,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1086 transitions. [2021-10-21 19:36:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-21 19:36:07,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:07,863 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:07,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:36:07,864 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1609314537, now seen corresponding path program 1 times [2021-10-21 19:36:07,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:07,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136433804] [2021-10-21 19:36:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:07,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:07,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:07,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136433804] [2021-10-21 19:36:07,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136433804] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:07,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:07,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:36:07,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555603731] [2021-10-21 19:36:07,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:36:07,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:36:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:07,975 INFO L87 Difference]: Start difference. First operand 827 states and 1086 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:08,197 INFO L93 Difference]: Finished difference Result 2702 states and 3678 transitions. [2021-10-21 19:36:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:36:08,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-21 19:36:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:08,220 INFO L225 Difference]: With dead ends: 2702 [2021-10-21 19:36:08,227 INFO L226 Difference]: Without dead ends: 2201 [2021-10-21 19:36:08,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-10-21 19:36:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 904. [2021-10-21 19:36:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.312638580931264) internal successors, (1184), 903 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1184 transitions. [2021-10-21 19:36:08,350 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1184 transitions. Word has length 198 [2021-10-21 19:36:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:08,351 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1184 transitions. [2021-10-21 19:36:08,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1184 transitions. [2021-10-21 19:36:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-21 19:36:08,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:08,355 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:08,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:36:08,356 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1927329879, now seen corresponding path program 1 times [2021-10-21 19:36:08,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:08,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60772511] [2021-10-21 19:36:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:08,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:08,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:08,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60772511] [2021-10-21 19:36:08,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60772511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:08,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:08,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:36:08,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116702101] [2021-10-21 19:36:08,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:36:08,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:36:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:36:08,523 INFO L87 Difference]: Start difference. First operand 904 states and 1184 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:08,981 INFO L93 Difference]: Finished difference Result 2175 states and 2872 transitions. [2021-10-21 19:36:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:36:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-21 19:36:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:08,985 INFO L225 Difference]: With dead ends: 2175 [2021-10-21 19:36:08,986 INFO L226 Difference]: Without dead ends: 1600 [2021-10-21 19:36:08,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.0ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:36:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-10-21 19:36:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 966. [2021-10-21 19:36:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 964 states have (on average 1.3008298755186722) internal successors, (1254), 965 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1254 transitions. [2021-10-21 19:36:09,085 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1254 transitions. Word has length 198 [2021-10-21 19:36:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:09,085 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1254 transitions. [2021-10-21 19:36:09,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1254 transitions. [2021-10-21 19:36:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-21 19:36:09,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:09,089 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:09,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-21 19:36:09,089 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash 645504485, now seen corresponding path program 1 times [2021-10-21 19:36:09,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:09,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968960726] [2021-10-21 19:36:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:09,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:09,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:09,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968960726] [2021-10-21 19:36:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968960726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:09,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:09,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:36:09,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469614483] [2021-10-21 19:36:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:36:09,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:36:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:36:09,258 INFO L87 Difference]: Start difference. First operand 966 states and 1254 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:09,683 INFO L93 Difference]: Finished difference Result 2008 states and 2642 transitions. [2021-10-21 19:36:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:36:09,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-10-21 19:36:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:09,687 INFO L225 Difference]: With dead ends: 2008 [2021-10-21 19:36:09,688 INFO L226 Difference]: Without dead ends: 1366 [2021-10-21 19:36:09,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.6ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:36:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-10-21 19:36:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 933. [2021-10-21 19:36:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 931 states have (on average 1.3029001074113855) internal successors, (1213), 932 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2021-10-21 19:36:09,787 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 198 [2021-10-21 19:36:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:09,788 INFO L470 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2021-10-21 19:36:09,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2021-10-21 19:36:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-21 19:36:09,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:09,793 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:09,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 19:36:09,793 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1197921535, now seen corresponding path program 1 times [2021-10-21 19:36:09,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:09,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114111280] [2021-10-21 19:36:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:09,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-10-21 19:36:09,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:09,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114111280] [2021-10-21 19:36:09,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114111280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:09,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:09,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:09,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251987222] [2021-10-21 19:36:09,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:09,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:09,868 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:10,093 INFO L93 Difference]: Finished difference Result 1691 states and 2224 transitions. [2021-10-21 19:36:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2021-10-21 19:36:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:10,096 INFO L225 Difference]: With dead ends: 1691 [2021-10-21 19:36:10,097 INFO L226 Difference]: Without dead ends: 1090 [2021-10-21 19:36:10,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-10-21 19:36:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 833. [2021-10-21 19:36:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.28125) internal successors, (1066), 832 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1066 transitions. [2021-10-21 19:36:10,182 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1066 transitions. Word has length 207 [2021-10-21 19:36:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:10,183 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1066 transitions. [2021-10-21 19:36:10,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1066 transitions. [2021-10-21 19:36:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-21 19:36:10,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:10,187 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 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] [2021-10-21 19:36:10,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-21 19:36:10,189 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1187317822, now seen corresponding path program 1 times [2021-10-21 19:36:10,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:10,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999872960] [2021-10-21 19:36:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:10,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-10-21 19:36:10,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:10,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999872960] [2021-10-21 19:36:10,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999872960] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:10,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158605495] [2021-10-21 19:36:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:10,526 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:10,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:10,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-21 19:36:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:10,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-21 19:36:10,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-10-21 19:36:11,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158605495] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:11,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:36:11,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2021-10-21 19:36:11,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676377831] [2021-10-21 19:36:11,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:36:11,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:36:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:36:11,515 INFO L87 Difference]: Start difference. First operand 833 states and 1066 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:11,994 INFO L93 Difference]: Finished difference Result 2343 states and 3029 transitions. [2021-10-21 19:36:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:36:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-10-21 19:36:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:11,999 INFO L225 Difference]: With dead ends: 2343 [2021-10-21 19:36:11,999 INFO L226 Difference]: Without dead ends: 1842 [2021-10-21 19:36:12,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 180.7ms TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:36:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-10-21 19:36:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 869. [2021-10-21 19:36:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.2799539170506913) internal successors, (1111), 868 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1111 transitions. [2021-10-21 19:36:12,109 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1111 transitions. Word has length 232 [2021-10-21 19:36:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:12,110 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1111 transitions. [2021-10-21 19:36:12,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1111 transitions. [2021-10-21 19:36:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-21 19:36:12,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:12,115 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 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] [2021-10-21 19:36:12,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:12,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:12,339 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1244576124, now seen corresponding path program 1 times [2021-10-21 19:36:12,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:12,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782315530] [2021-10-21 19:36:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:12,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-10-21 19:36:12,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:12,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782315530] [2021-10-21 19:36:12,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782315530] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:12,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:12,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:12,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195706832] [2021-10-21 19:36:12,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:12,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:12,457 INFO L87 Difference]: Start difference. First operand 869 states and 1111 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:12,616 INFO L93 Difference]: Finished difference Result 1689 states and 2151 transitions. [2021-10-21 19:36:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-10-21 19:36:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:12,619 INFO L225 Difference]: With dead ends: 1689 [2021-10-21 19:36:12,620 INFO L226 Difference]: Without dead ends: 1115 [2021-10-21 19:36:12,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2021-10-21 19:36:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 863. [2021-10-21 19:36:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.2552204176334107) internal successors, (1082), 862 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1082 transitions. [2021-10-21 19:36:12,713 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1082 transitions. Word has length 232 [2021-10-21 19:36:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:12,713 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1082 transitions. [2021-10-21 19:36:12,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1082 transitions. [2021-10-21 19:36:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-21 19:36:12,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:12,719 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1] [2021-10-21 19:36:12,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-21 19:36:12,719 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -836297208, now seen corresponding path program 1 times [2021-10-21 19:36:12,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:12,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024068335] [2021-10-21 19:36:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:12,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:12,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:12,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024068335] [2021-10-21 19:36:12,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024068335] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:12,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829651236] [2021-10-21 19:36:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:12,918 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:12,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:12,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-21 19:36:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:13,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:36:13,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:13,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829651236] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:13,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:13,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-21 19:36:13,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106830012] [2021-10-21 19:36:13,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:36:13,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:36:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:36:13,992 INFO L87 Difference]: Start difference. First operand 863 states and 1082 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:14,941 INFO L93 Difference]: Finished difference Result 3434 states and 4393 transitions. [2021-10-21 19:36:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-21 19:36:14,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-10-21 19:36:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:14,947 INFO L225 Difference]: With dead ends: 3434 [2021-10-21 19:36:14,947 INFO L226 Difference]: Without dead ends: 2903 [2021-10-21 19:36:14,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 441.2ms TimeCoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2021-10-21 19:36:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2021-10-21 19:36:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1429. [2021-10-21 19:36:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.2584033613445378) internal successors, (1797), 1428 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1797 transitions. [2021-10-21 19:36:15,132 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1797 transitions. Word has length 238 [2021-10-21 19:36:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:15,132 INFO L470 AbstractCegarLoop]: Abstraction has 1429 states and 1797 transitions. [2021-10-21 19:36:15,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1797 transitions. [2021-10-21 19:36:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-21 19:36:15,138 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:15,138 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 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, 1, 1] [2021-10-21 19:36:15,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:15,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-10-21 19:36:15,351 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1012261644, now seen corresponding path program 1 times [2021-10-21 19:36:15,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:15,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489200685] [2021-10-21 19:36:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:15,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:15,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:15,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489200685] [2021-10-21 19:36:15,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489200685] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:15,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540197391] [2021-10-21 19:36:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:15,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:15,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:15,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-21 19:36:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:15,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:36:16,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:16,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540197391] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:16,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:16,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-21 19:36:16,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461634586] [2021-10-21 19:36:16,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:36:16,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:36:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:36:16,706 INFO L87 Difference]: Start difference. First operand 1429 states and 1797 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:17,914 INFO L93 Difference]: Finished difference Result 7331 states and 9345 transitions. [2021-10-21 19:36:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-21 19:36:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-10-21 19:36:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:17,925 INFO L225 Difference]: With dead ends: 7331 [2021-10-21 19:36:17,926 INFO L226 Difference]: Without dead ends: 6277 [2021-10-21 19:36:17,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 418.4ms TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-10-21 19:36:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2021-10-21 19:36:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 3475. [2021-10-21 19:36:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3474 states have (on average 1.2377662636729994) internal successors, (4300), 3474 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 4300 transitions. [2021-10-21 19:36:18,287 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 4300 transitions. Word has length 238 [2021-10-21 19:36:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:18,288 INFO L470 AbstractCegarLoop]: Abstraction has 3475 states and 4300 transitions. [2021-10-21 19:36:18,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 4300 transitions. [2021-10-21 19:36:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-21 19:36:18,295 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:18,295 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-10-21 19:36:18,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-21 19:36:18,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-10-21 19:36:18,511 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1132569626, now seen corresponding path program 1 times [2021-10-21 19:36:18,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:18,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262173992] [2021-10-21 19:36:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:18,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:18,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:18,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262173992] [2021-10-21 19:36:18,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262173992] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:18,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657335816] [2021-10-21 19:36:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:18,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:18,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:18,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-21 19:36:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:19,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-21 19:36:19,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-10-21 19:36:19,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657335816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:19,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:36:19,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2021-10-21 19:36:19,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572827390] [2021-10-21 19:36:19,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:36:19,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:36:19,972 INFO L87 Difference]: Start difference. First operand 3475 states and 4300 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:20,420 INFO L93 Difference]: Finished difference Result 6552 states and 8126 transitions. [2021-10-21 19:36:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2021-10-21 19:36:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:20,426 INFO L225 Difference]: With dead ends: 6552 [2021-10-21 19:36:20,427 INFO L226 Difference]: Without dead ends: 3365 [2021-10-21 19:36:20,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 215.2ms TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:36:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2021-10-21 19:36:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365. [2021-10-21 19:36:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2271105826397146) internal successors, (4128), 3364 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4128 transitions. [2021-10-21 19:36:20,734 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4128 transitions. Word has length 239 [2021-10-21 19:36:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:20,734 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4128 transitions. [2021-10-21 19:36:20,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4128 transitions. [2021-10-21 19:36:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-10-21 19:36:20,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:20,740 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 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, 1, 1, 1, 1] [2021-10-21 19:36:20,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:20,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-10-21 19:36:20,943 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1180183742, now seen corresponding path program 1 times [2021-10-21 19:36:20,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:20,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978789857] [2021-10-21 19:36:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:20,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:21,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:21,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978789857] [2021-10-21 19:36:21,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978789857] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:21,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049289180] [2021-10-21 19:36:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:21,333 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:21,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:21,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-21 19:36:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:21,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-21 19:36:21,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-10-21 19:36:22,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049289180] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:22,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:22,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2021-10-21 19:36:22,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864582688] [2021-10-21 19:36:22,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-21 19:36:22,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-21 19:36:22,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-10-21 19:36:22,809 INFO L87 Difference]: Start difference. First operand 3365 states and 4128 transitions. Second operand has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:30,427 INFO L93 Difference]: Finished difference Result 23508 states and 29620 transitions. [2021-10-21 19:36:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-10-21 19:36:30,427 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2021-10-21 19:36:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:30,464 INFO L225 Difference]: With dead ends: 23508 [2021-10-21 19:36:30,464 INFO L226 Difference]: Without dead ends: 20570 [2021-10-21 19:36:30,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8441 ImplicationChecksByTransitivity, 3289.1ms TimeCoverageRelationStatistics Valid=2584, Invalid=23498, Unknown=0, NotChecked=0, Total=26082 [2021-10-21 19:36:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2021-10-21 19:36:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 5159. [2021-10-21 19:36:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5159 states, 5158 states have (on average 1.2194649088794107) internal successors, (6290), 5158 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 6290 transitions. [2021-10-21 19:36:31,082 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 6290 transitions. Word has length 240 [2021-10-21 19:36:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:31,082 INFO L470 AbstractCegarLoop]: Abstraction has 5159 states and 6290 transitions. [2021-10-21 19:36:31,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 6290 transitions. [2021-10-21 19:36:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-21 19:36:31,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:31,092 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:31,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-10-21 19:36:31,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:31,307 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -365509161, now seen corresponding path program 1 times [2021-10-21 19:36:31,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:31,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387955271] [2021-10-21 19:36:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:31,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-10-21 19:36:31,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:31,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387955271] [2021-10-21 19:36:31,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387955271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:31,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:31,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:31,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761278695] [2021-10-21 19:36:31,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:36:31,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:31,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:31,356 INFO L87 Difference]: Start difference. First operand 5159 states and 6290 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:31,972 INFO L93 Difference]: Finished difference Result 9887 states and 12052 transitions. [2021-10-21 19:36:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2021-10-21 19:36:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:31,982 INFO L225 Difference]: With dead ends: 9887 [2021-10-21 19:36:31,982 INFO L226 Difference]: Without dead ends: 4741 [2021-10-21 19:36:31,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2021-10-21 19:36:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4741. [2021-10-21 19:36:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.2168776371308017) internal successors, (5768), 4740 states have internal predecessors, (5768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 5768 transitions. [2021-10-21 19:36:32,548 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 5768 transitions. Word has length 243 [2021-10-21 19:36:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:32,550 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 5768 transitions. [2021-10-21 19:36:32,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 5768 transitions. [2021-10-21 19:36:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-10-21 19:36:32,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:32,559 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 19:36:32,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-21 19:36:32,559 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1487829042, now seen corresponding path program 1 times [2021-10-21 19:36:32,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:32,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818344728] [2021-10-21 19:36:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:32,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-10-21 19:36:32,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:32,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818344728] [2021-10-21 19:36:32,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818344728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:32,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:32,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:32,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104146782] [2021-10-21 19:36:32,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:36:32,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:32,654 INFO L87 Difference]: Start difference. First operand 4741 states and 5768 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:33,125 INFO L93 Difference]: Finished difference Result 8885 states and 10825 transitions. [2021-10-21 19:36:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2021-10-21 19:36:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:33,133 INFO L225 Difference]: With dead ends: 8885 [2021-10-21 19:36:33,133 INFO L226 Difference]: Without dead ends: 4769 [2021-10-21 19:36:33,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2021-10-21 19:36:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4762. [2021-10-21 19:36:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4762 states, 4761 states have (on average 1.2157109850871666) internal successors, (5788), 4761 states have internal predecessors, (5788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 5788 transitions. [2021-10-21 19:36:33,635 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 5788 transitions. Word has length 246 [2021-10-21 19:36:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:33,635 INFO L470 AbstractCegarLoop]: Abstraction has 4762 states and 5788 transitions. [2021-10-21 19:36:33,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 5788 transitions. [2021-10-21 19:36:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-10-21 19:36:33,644 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:33,644 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-21 19:36:33,645 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash -923801151, now seen corresponding path program 1 times [2021-10-21 19:36:33,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:33,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436486482] [2021-10-21 19:36:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:33,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:33,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:33,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436486482] [2021-10-21 19:36:33,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436486482] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:33,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686839819] [2021-10-21 19:36:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:33,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:33,934 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:33,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-21 19:36:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-21 19:36:34,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-10-21 19:36:35,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686839819] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:35,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:35,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-10-21 19:36:35,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209598921] [2021-10-21 19:36:35,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-21 19:36:35,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:35,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-21 19:36:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:36:35,930 INFO L87 Difference]: Start difference. First operand 4762 states and 5788 transitions. Second operand has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:52,597 INFO L93 Difference]: Finished difference Result 40803 states and 50962 transitions. [2021-10-21 19:36:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2021-10-21 19:36:52,598 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2021-10-21 19:36:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:52,648 INFO L225 Difference]: With dead ends: 40803 [2021-10-21 19:36:52,649 INFO L226 Difference]: Without dead ends: 36683 [2021-10-21 19:36:52,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21753 ImplicationChecksByTransitivity, 7214.9ms TimeCoverageRelationStatistics Valid=6041, Invalid=49419, Unknown=0, NotChecked=0, Total=55460 [2021-10-21 19:36:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2021-10-21 19:36:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 5155. [2021-10-21 19:36:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2180830422972448) internal successors, (6278), 5154 states have internal predecessors, (6278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6278 transitions. [2021-10-21 19:36:53,453 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6278 transitions. Word has length 247 [2021-10-21 19:36:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:53,454 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6278 transitions. [2021-10-21 19:36:53,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6278 transitions. [2021-10-21 19:36:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-10-21 19:36:53,464 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:53,464 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:53,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:53,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-10-21 19:36:53,679 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1336287465, now seen corresponding path program 1 times [2021-10-21 19:36:53,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:53,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450065634] [2021-10-21 19:36:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:53,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-21 19:36:53,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:53,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450065634] [2021-10-21 19:36:53,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450065634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:53,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:53,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:53,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198452402] [2021-10-21 19:36:53,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:36:53,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:53,829 INFO L87 Difference]: Start difference. First operand 5155 states and 6278 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:54,698 INFO L93 Difference]: Finished difference Result 9682 states and 11849 transitions. [2021-10-21 19:36:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-10-21 19:36:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:36:54,703 INFO L225 Difference]: With dead ends: 9682 [2021-10-21 19:36:54,703 INFO L226 Difference]: Without dead ends: 5155 [2021-10-21 19:36:54,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2021-10-21 19:36:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5155. [2021-10-21 19:36:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.214396585176562) internal successors, (6259), 5154 states have internal predecessors, (6259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6259 transitions. [2021-10-21 19:36:55,445 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6259 transitions. Word has length 254 [2021-10-21 19:36:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:36:55,445 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6259 transitions. [2021-10-21 19:36:55,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6259 transitions. [2021-10-21 19:36:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-10-21 19:36:55,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:36:55,454 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:55,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-21 19:36:55,455 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:36:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1666210174, now seen corresponding path program 1 times [2021-10-21 19:36:55,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:55,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31890673] [2021-10-21 19:36:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:55,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:36:55,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:55,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31890673] [2021-10-21 19:36:55,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31890673] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:55,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375567951] [2021-10-21 19:36:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:55,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:55,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:55,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-21 19:36:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:56,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-21 19:36:56,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 38 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-21 19:36:57,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375567951] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:57,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:57,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2021-10-21 19:36:57,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581539660] [2021-10-21 19:36:57,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-21 19:36:57,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-21 19:36:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2021-10-21 19:36:57,918 INFO L87 Difference]: Start difference. First operand 5155 states and 6259 transitions. Second operand has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:37:09,717 INFO L93 Difference]: Finished difference Result 34391 states and 43026 transitions. [2021-10-21 19:37:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-10-21 19:37:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-10-21 19:37:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:37:09,749 INFO L225 Difference]: With dead ends: 34391 [2021-10-21 19:37:09,749 INFO L226 Difference]: Without dead ends: 30122 [2021-10-21 19:37:09,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10072 ImplicationChecksByTransitivity, 4096.5ms TimeCoverageRelationStatistics Valid=2832, Invalid=28320, Unknown=0, NotChecked=0, Total=31152 [2021-10-21 19:37:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30122 states. [2021-10-21 19:37:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30122 to 5155. [2021-10-21 19:37:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2120682964687621) internal successors, (6247), 5154 states have internal predecessors, (6247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6247 transitions. [2021-10-21 19:37:10,680 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6247 transitions. Word has length 254 [2021-10-21 19:37:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:37:10,681 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6247 transitions. [2021-10-21 19:37:10,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6247 transitions. [2021-10-21 19:37:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-21 19:37:10,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:37:10,691 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:37:10,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-21 19:37:10,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:37:10,905 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:37:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:37:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1107246419, now seen corresponding path program 1 times [2021-10-21 19:37:10,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:37:10,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344332091] [2021-10-21 19:37:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:37:10,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:37:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:37:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:37:11,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:37:11,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344332091] [2021-10-21 19:37:11,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344332091] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:37:11,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973068769] [2021-10-21 19:37:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:37:11,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:37:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:37:11,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:37:11,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-21 19:37:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:37:12,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-21 19:37:12,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:37:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:37:13,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973068769] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:37:13,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:37:13,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2021-10-21 19:37:13,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733677576] [2021-10-21 19:37:13,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-21 19:37:13,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:37:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-21 19:37:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2021-10-21 19:37:13,487 INFO L87 Difference]: Start difference. First operand 5155 states and 6247 transitions. Second operand has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:37:49,344 INFO L93 Difference]: Finished difference Result 60340 states and 75705 transitions. [2021-10-21 19:37:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2021-10-21 19:37:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-21 19:37:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:37:49,444 INFO L225 Difference]: With dead ends: 60340 [2021-10-21 19:37:49,444 INFO L226 Difference]: Without dead ends: 56573 [2021-10-21 19:37:49,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124344 ImplicationChecksByTransitivity, 20248.6ms TimeCoverageRelationStatistics Valid=24889, Invalid=266171, Unknown=0, NotChecked=0, Total=291060 [2021-10-21 19:37:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56573 states. [2021-10-21 19:37:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56573 to 7732. [2021-10-21 19:37:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2392963394127539) internal successors, (9581), 7731 states have internal predecessors, (9581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9581 transitions. [2021-10-21 19:37:51,093 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9581 transitions. Word has length 271 [2021-10-21 19:37:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:37:51,094 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9581 transitions. [2021-10-21 19:37:51,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9581 transitions. [2021-10-21 19:37:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-21 19:37:51,109 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:37:51,109 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:37:51,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-21 19:37:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:37:51,331 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:37:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:37:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1536904725, now seen corresponding path program 1 times [2021-10-21 19:37:51,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:37:51,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126328903] [2021-10-21 19:37:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:37:51,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:37:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:37:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-21 19:37:51,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:37:51,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126328903] [2021-10-21 19:37:51,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126328903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:37:51,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:37:51,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:37:51,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841284280] [2021-10-21 19:37:51,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:37:51,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:37:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:37:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:37:51,462 INFO L87 Difference]: Start difference. First operand 7732 states and 9581 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:37:52,889 INFO L93 Difference]: Finished difference Result 14190 states and 17630 transitions. [2021-10-21 19:37:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:37:52,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-21 19:37:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:37:52,897 INFO L225 Difference]: With dead ends: 14190 [2021-10-21 19:37:52,897 INFO L226 Difference]: Without dead ends: 7732 [2021-10-21 19:37:52,903 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:37:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2021-10-21 19:37:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7732. [2021-10-21 19:37:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2358039063510542) internal successors, (9554), 7731 states have internal predecessors, (9554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9554 transitions. [2021-10-21 19:37:54,035 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9554 transitions. Word has length 271 [2021-10-21 19:37:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:37:54,035 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9554 transitions. [2021-10-21 19:37:54,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:37:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9554 transitions. [2021-10-21 19:37:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-21 19:37:54,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:37:54,047 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:37:54,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-21 19:37:54,048 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:37:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:37:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash -240703937, now seen corresponding path program 1 times [2021-10-21 19:37:54,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:37:54,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958851603] [2021-10-21 19:37:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:37:54,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:37:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:37:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:37:54,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:37:54,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958851603] [2021-10-21 19:37:54,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958851603] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:37:54,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205747871] [2021-10-21 19:37:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:37:54,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:37:54,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:37:54,380 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:37:54,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-21 19:37:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:37:55,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-21 19:37:55,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:37:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:37:56,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205747871] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:37:56,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:37:56,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-21 19:37:56,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179051342] [2021-10-21 19:37:56,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-21 19:37:56,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:37:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-21 19:37:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-10-21 19:37:56,977 INFO L87 Difference]: Start difference. First operand 7732 states and 9554 transitions. Second operand has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:38:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:38:45,853 INFO L93 Difference]: Finished difference Result 122734 states and 155659 transitions. [2021-10-21 19:38:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2021-10-21 19:38:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-21 19:38:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:38:46,103 INFO L225 Difference]: With dead ends: 122734 [2021-10-21 19:38:46,103 INFO L226 Difference]: Without dead ends: 117248 [2021-10-21 19:38:46,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76865 ImplicationChecksByTransitivity, 14250.5ms TimeCoverageRelationStatistics Valid=15860, Invalid=169470, Unknown=0, NotChecked=0, Total=185330 [2021-10-21 19:38:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117248 states. [2021-10-21 19:38:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117248 to 10897. [2021-10-21 19:38:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10897 states, 10896 states have (on average 1.2372430249632893) internal successors, (13481), 10896 states have internal predecessors, (13481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:38:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 13481 transitions. [2021-10-21 19:38:49,480 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 13481 transitions. Word has length 271 [2021-10-21 19:38:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:38:49,481 INFO L470 AbstractCegarLoop]: Abstraction has 10897 states and 13481 transitions. [2021-10-21 19:38:49,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:38:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 13481 transitions. [2021-10-21 19:38:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-21 19:38:49,495 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:38:49,496 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:38:49,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-21 19:38:49,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-10-21 19:38:49,697 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:38:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:38:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1858144387, now seen corresponding path program 1 times [2021-10-21 19:38:49,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:38:49,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200302748] [2021-10-21 19:38:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:38:49,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:38:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:38:50,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:38:50,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200302748] [2021-10-21 19:38:50,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200302748] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:38:50,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822449435] [2021-10-21 19:38:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:38:50,299 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:38:50,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:38:50,300 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:38:50,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-21 19:38:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:38:51,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-21 19:38:51,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:38:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-10-21 19:38:52,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822449435] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:38:52,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:38:52,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 27 [2021-10-21 19:38:52,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216122529] [2021-10-21 19:38:52,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-21 19:38:52,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:38:52,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-21 19:38:52,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:38:52,233 INFO L87 Difference]: Start difference. First operand 10897 states and 13481 transitions. Second operand has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:39:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:39:08,296 INFO L93 Difference]: Finished difference Result 55046 states and 69950 transitions. [2021-10-21 19:39:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-10-21 19:39:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-21 19:39:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:39:08,352 INFO L225 Difference]: With dead ends: 55046 [2021-10-21 19:39:08,352 INFO L226 Difference]: Without dead ends: 45210 [2021-10-21 19:39:08,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2070.0ms TimeCoverageRelationStatistics Valid=937, Invalid=7073, Unknown=0, NotChecked=0, Total=8010 [2021-10-21 19:39:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45210 states. [2021-10-21 19:39:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45210 to 10073. [2021-10-21 19:39:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:39:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-10-21 19:39:10,973 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 271 [2021-10-21 19:39:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:39:10,974 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-10-21 19:39:10,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:39:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-10-21 19:39:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-21 19:39:10,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:39:10,983 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:39:11,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-21 19:39:11,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-10-21 19:39:11,184 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:39:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:39:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1031243988, now seen corresponding path program 1 times [2021-10-21 19:39:11,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:39:11,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182668927] [2021-10-21 19:39:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:11,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:39:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:39:11,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:39:11,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182668927] [2021-10-21 19:39:11,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182668927] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:39:11,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976222937] [2021-10-21 19:39:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:39:11,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:39:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:39:11,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:39:11,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-21 19:39:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:39:13,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-21 19:39:13,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:39:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-21 19:39:14,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976222937] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:39:14,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:39:14,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-21 19:39:14,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652975343] [2021-10-21 19:39:14,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-21 19:39:14,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:39:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-21 19:39:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-21 19:39:14,681 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:25,354 INFO L93 Difference]: Finished difference Result 136667 states and 174665 transitions. [2021-10-21 19:40:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-21 19:40:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-21 19:40:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:25,563 INFO L225 Difference]: With dead ends: 136667 [2021-10-21 19:40:25,564 INFO L226 Difference]: Without dead ends: 127314 [2021-10-21 19:40:25,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92597 ImplicationChecksByTransitivity, 21464.0ms TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-21 19:40:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127314 states. [2021-10-21 19:40:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127314 to 10187. [2021-10-21 19:40:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 1.2487728254466914) internal successors, (12720), 10186 states have internal predecessors, (12720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 12720 transitions. [2021-10-21 19:40:29,914 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 12720 transitions. Word has length 272 [2021-10-21 19:40:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:29,915 INFO L470 AbstractCegarLoop]: Abstraction has 10187 states and 12720 transitions. [2021-10-21 19:40:29,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 12720 transitions. [2021-10-21 19:40:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-21 19:40:29,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:29,926 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:40:29,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-10-21 19:40:30,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:40:30,128 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:40:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash 601585682, now seen corresponding path program 1 times [2021-10-21 19:40:30,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:30,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435199883] [2021-10-21 19:40:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:30,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-21 19:40:30,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:30,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435199883] [2021-10-21 19:40:30,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435199883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:30,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:30,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:30,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686103816] [2021-10-21 19:40:30,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:40:30,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:40:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:40:30,325 INFO L87 Difference]: Start difference. First operand 10187 states and 12720 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:33,820 INFO L93 Difference]: Finished difference Result 19918 states and 24931 transitions. [2021-10-21 19:40:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:40:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-21 19:40:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:33,831 INFO L225 Difference]: With dead ends: 19918 [2021-10-21 19:40:33,831 INFO L226 Difference]: Without dead ends: 10225 [2021-10-21 19:40:33,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:40:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10225 states. [2021-10-21 19:40:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10225 to 10073. [2021-10-21 19:40:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-10-21 19:40:36,820 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 272 [2021-10-21 19:40:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:36,821 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-10-21 19:40:36,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-10-21 19:40:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-10-21 19:40:36,829 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:36,829 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:40:36,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-21 19:40:36,829 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:40:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 83192022, now seen corresponding path program 1 times [2021-10-21 19:40:36,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:36,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619935521] [2021-10-21 19:40:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:36,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-10-21 19:40:36,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:36,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619935521] [2021-10-21 19:40:36,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619935521] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:36,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:36,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:40:36,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590344070] [2021-10-21 19:40:36,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:40:36,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:36,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:40:36,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:40:36,964 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:39,340 INFO L93 Difference]: Finished difference Result 16616 states and 20833 transitions. [2021-10-21 19:40:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:40:39,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-10-21 19:40:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:39,348 INFO L225 Difference]: With dead ends: 16616 [2021-10-21 19:40:39,348 INFO L226 Difference]: Without dead ends: 6965 [2021-10-21 19:40:39,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:40:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2021-10-21 19:40:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6965. [2021-10-21 19:40:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 6964 states have (on average 1.2498564043653073) internal successors, (8704), 6964 states have internal predecessors, (8704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 8704 transitions. [2021-10-21 19:40:41,693 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 8704 transitions. Word has length 272 [2021-10-21 19:40:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:41,694 INFO L470 AbstractCegarLoop]: Abstraction has 6965 states and 8704 transitions. [2021-10-21 19:40:41,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 8704 transitions. [2021-10-21 19:40:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-10-21 19:40:41,699 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:41,699 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:40:41,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-21 19:40:41,700 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:40:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1004446436, now seen corresponding path program 1 times [2021-10-21 19:40:41,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:41,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197369700] [2021-10-21 19:40:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:41,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:40:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-10-21 19:40:41,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:40:41,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197369700] [2021-10-21 19:40:41,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197369700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:40:41,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:40:41,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:40:41,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900698122] [2021-10-21 19:40:41,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:40:41,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:40:41,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:40:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:40:41,842 INFO L87 Difference]: Start difference. First operand 6965 states and 8704 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:40:47,152 INFO L93 Difference]: Finished difference Result 17973 states and 22586 transitions. [2021-10-21 19:40:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:40:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2021-10-21 19:40:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:40:47,169 INFO L225 Difference]: With dead ends: 17973 [2021-10-21 19:40:47,170 INFO L226 Difference]: Without dead ends: 11650 [2021-10-21 19:40:47,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:40:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2021-10-21 19:40:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 6925. [2021-10-21 19:40:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6925 states, 6924 states have (on average 1.2484113229347198) internal successors, (8644), 6924 states have internal predecessors, (8644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8644 transitions. [2021-10-21 19:40:49,165 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8644 transitions. Word has length 274 [2021-10-21 19:40:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:40:49,165 INFO L470 AbstractCegarLoop]: Abstraction has 6925 states and 8644 transitions. [2021-10-21 19:40:49,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:40:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8644 transitions. [2021-10-21 19:40:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-10-21 19:40:49,170 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:40:49,171 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:40:49,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-21 19:40:49,171 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-21 19:40:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:40:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 11587278, now seen corresponding path program 1 times [2021-10-21 19:40:49,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:40:49,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38843420] [2021-10-21 19:40:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:40:49,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:40:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:40:49,250 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:40:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:40:49,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:40:49,505 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:40:49,507 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:40:49,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-21 19:40:49,523 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:40:49,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:40:49 BoogieIcfgContainer [2021-10-21 19:40:49,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:40:49,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:40:49,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:40:49,822 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:40:49,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:35:58" (3/4) ... [2021-10-21 19:40:49,826 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:40:50,219 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:40:50,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:40:50,221 INFO L168 Benchmark]: Toolchain (without parser) took 294284.17 ms. Allocated memory was 130.0 MB in the beginning and 5.8 GB in the end (delta: 5.6 GB). Free memory was 91.5 MB in the beginning and 4.9 GB in the end (delta: -4.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,222 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 130.0 MB. Free memory was 100.5 MB in the beginning and 100.5 MB in the end (delta: 28.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:40:50,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.37 ms. Allocated memory is still 130.0 MB. Free memory was 91.1 MB in the beginning and 96.7 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.56 ms. Allocated memory is still 130.0 MB. Free memory was 96.1 MB in the beginning and 90.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,223 INFO L168 Benchmark]: Boogie Preprocessor took 155.08 ms. Allocated memory is still 130.0 MB. Free memory was 90.4 MB in the beginning and 84.9 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,223 INFO L168 Benchmark]: RCFGBuilder took 1556.19 ms. Allocated memory was 130.0 MB in the beginning and 161.5 MB in the end (delta: 31.5 MB). Free memory was 84.9 MB in the beginning and 116.3 MB in the end (delta: -31.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,224 INFO L168 Benchmark]: TraceAbstraction took 291651.26 ms. Allocated memory was 161.5 MB in the beginning and 5.8 GB in the end (delta: 5.6 GB). Free memory was 116.3 MB in the beginning and 3.8 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,224 INFO L168 Benchmark]: Witness Printer took 398.24 ms. Allocated memory is still 5.8 GB. Free memory was 3.8 GB in the beginning and 4.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:40:50,226 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.26 ms. Allocated memory is still 130.0 MB. Free memory was 100.5 MB in the beginning and 100.5 MB in the end (delta: 28.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.37 ms. Allocated memory is still 130.0 MB. Free memory was 91.1 MB in the beginning and 96.7 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 116.56 ms. Allocated memory is still 130.0 MB. Free memory was 96.1 MB in the beginning and 90.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 155.08 ms. Allocated memory is still 130.0 MB. Free memory was 90.4 MB in the beginning and 84.9 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1556.19 ms. Allocated memory was 130.0 MB in the beginning and 161.5 MB in the end (delta: 31.5 MB). Free memory was 84.9 MB in the beginning and 116.3 MB in the end (delta: -31.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 291651.26 ms. Allocated memory was 161.5 MB in the beginning and 5.8 GB in the end (delta: 5.6 GB). Free memory was 116.3 MB in the beginning and 3.8 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. * Witness Printer took 398.24 ms. Allocated memory is still 5.8 GB. Free memory was 3.8 GB in the beginning and 4.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 537]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L502] i2 = init() [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] i2 = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L252] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L255] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L258] COND TRUE ! gate3Failed [L259] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L297] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L336] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L523] c1 = check() [L535] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L410] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] c1 = check() [L535] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L537] reach_error() VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 521 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 291274.2ms, OverallIterations: 55, TraceHistogramMax: 3, EmptinessCheckTime: 246.7ms, AutomataDifference: 231343.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 29876 SDtfs, 56295 SDslu, 207330 SDs, 0 SdLazy, 67680 SolverSat, 1605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26681.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5510 GetRequests, 3134 SyntacticMatches, 4 SemanticMatches, 2372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337292 ImplicationChecksByTransitivity, 74745.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10897occurred in iteration=49, InterpolantAutomatonStates: 2223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 26925.8ms AutomataMinimizationTime, 54 MinimizatonAttempts, 401852 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 851.7ms SsaConstructionTime, 3097.7ms SatisfiabilityAnalysisTime, 18024.7ms InterpolantComputationTime, 12153 NumberOfCodeBlocks, 12153 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11807 ConstructedInterpolants, 0 QuantifiedInterpolants, 38129 SizeOfPredicates, 93 NumberOfNonLiveVariables, 12992 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 68 InterpolantComputations, 42 PerfectInterpolantSequences, 6669/7385 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:40:50,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbabf39c-33b9-4f62-90a4-ae4fbe29d6b0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...