./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD --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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-b2eff8b [2021-10-28 22:59:00,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:59:00,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:59:00,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:59:00,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:59:00,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:59:00,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:59:00,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:59:00,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:59:00,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:59:00,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:59:00,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:59:00,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:59:00,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:59:00,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:59:00,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:59:00,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:59:00,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:59:00,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:59:00,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:59:00,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:59:00,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:59:00,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:59:00,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:59:00,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:59:00,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:59:00,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:59:00,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:59:00,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:59:00,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:59:00,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:59:00,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:59:00,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:59:00,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:59:00,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:59:00,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:59:00,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:59:00,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:59:00,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:59:00,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:59:00,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:59:00,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:59:00,820 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:59:00,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:59:00,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:59:00,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:59:00,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:59:00,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:59:00,823 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:59:00,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:59:00,823 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:59:00,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:59:00,824 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:59:00,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:59:00,825 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:59:00,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:59:00,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:59:00,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:59:00,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:59:00,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:59:00,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:59:00,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:59:00,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:59:00,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:59:00,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:59:00,834 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:59:00,835 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:59:00,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:59:00,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:59:00,836 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_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/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_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2021-10-28 22:59:01,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:59:01,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:59:01,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:59:01,156 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:59:01,156 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:59:01,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-28 22:59:01,252 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/data/b3066fdd6/2debb335db564b40b706aa5ca528e81d/FLAG0ce2e0e41 [2021-10-28 22:59:01,797 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:59:01,798 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-28 22:59:01,815 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/data/b3066fdd6/2debb335db564b40b706aa5ca528e81d/FLAG0ce2e0e41 [2021-10-28 22:59:02,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/data/b3066fdd6/2debb335db564b40b706aa5ca528e81d [2021-10-28 22:59:02,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:59:02,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:59:02,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:59:02,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:59:02,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:59:02,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2193cc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02, skipping insertion in model container [2021-10-28 22:59:02,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:59:02,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:59:02,497 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_e38d6de4-e512-48f1-bdaf-78596cd6679b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-10-28 22:59:02,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:59:02,510 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:59:02,567 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_e38d6de4-e512-48f1-bdaf-78596cd6679b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-10-28 22:59:02,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:59:02,586 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:59:02,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02 WrapperNode [2021-10-28 22:59:02,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:59:02,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:59:02,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:59:02,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:59:02,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:59:02,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:59:02,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:59:02,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:59:02,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:59:02,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:59:02,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:59:02,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:59:02,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (1/1) ... [2021-10-28 22:59:02,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:59:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:02,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:59:02,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:59:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:59:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:59:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:59:02,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:59:04,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:59:04,483 INFO L299 CfgBuilder]: Removed 173 assume(true) statements. [2021-10-28 22:59:04,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:04 BoogieIcfgContainer [2021-10-28 22:59:04,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:59:04,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:59:04,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:59:04,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:59:04,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:59:02" (1/3) ... [2021-10-28 22:59:04,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5453f64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:59:04, skipping insertion in model container [2021-10-28 22:59:04,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:02" (2/3) ... [2021-10-28 22:59:04,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5453f64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:59:04, skipping insertion in model container [2021-10-28 22:59:04,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:04" (3/3) ... [2021-10-28 22:59:04,500 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-28 22:59:04,505 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:59:04,505 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2021-10-28 22:59:04,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:59:04,563 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-28 22:59:04,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-10-28 22:59:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 480 states have (on average 1.8020833333333333) internal successors, (865), 517 states have internal predecessors, (865), 0 states have call successors, (0), 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-28 22:59:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-28 22:59:04,631 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:04,632 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:04,632 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-28 22:59:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2021-10-28 22:59:04,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:04,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642147669] [2021-10-28 22:59:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:04,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:04,902 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-28 22:59:04,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:04,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642147669] [2021-10-28 22:59:04,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642147669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:04,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:04,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:04,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288146948] [2021-10-28 22:59:04,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:04,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:04,949 INFO L87 Difference]: Start difference. First operand has 518 states, 480 states have (on average 1.8020833333333333) internal successors, (865), 517 states have internal predecessors, (865), 0 states have call successors, (0), 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-28 22:59:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:05,281 INFO L93 Difference]: Finished difference Result 1244 states and 2057 transitions. [2021-10-28 22:59:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:05,283 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-28 22:59:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:05,311 INFO L225 Difference]: With dead ends: 1244 [2021-10-28 22:59:05,311 INFO L226 Difference]: Without dead ends: 720 [2021-10-28 22:59:05,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-10-28 22:59:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 454. [2021-10-28 22:59:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 423 states have (on average 1.6761229314420805) internal successors, (709), 453 states have internal predecessors, (709), 0 states have call successors, (0), 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-28 22:59:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 709 transitions. [2021-10-28 22:59:05,406 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 709 transitions. Word has length 9 [2021-10-28 22:59:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:05,406 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 709 transitions. [2021-10-28 22:59:05,406 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-28 22:59:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 709 transitions. [2021-10-28 22:59:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 22:59:05,410 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:05,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:05,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:59:05,411 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-28 22:59:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2021-10-28 22:59:05,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:05,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003708417] [2021-10-28 22:59:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:05,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:05,473 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-28 22:59:05,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:05,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003708417] [2021-10-28 22:59:05,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003708417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:05,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:05,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:05,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782722560] [2021-10-28 22:59:05,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:05,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:05,478 INFO L87 Difference]: Start difference. First operand 454 states and 709 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-28 22:59:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:05,562 INFO L93 Difference]: Finished difference Result 1122 states and 1737 transitions. [2021-10-28 22:59:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:05,562 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-28 22:59:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:05,568 INFO L225 Difference]: With dead ends: 1122 [2021-10-28 22:59:05,569 INFO L226 Difference]: Without dead ends: 670 [2021-10-28 22:59:05,574 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-28 22:59:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 421. [2021-10-28 22:59:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 393 states have (on average 1.6564885496183206) internal successors, (651), 420 states have internal predecessors, (651), 0 states have call successors, (0), 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-28 22:59:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2021-10-28 22:59:05,616 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 10 [2021-10-28 22:59:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:05,616 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2021-10-28 22:59:05,616 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-28 22:59:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2021-10-28 22:59:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-28 22:59:05,619 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:05,620 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:05,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:59:05,621 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-28 22:59:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -248055967, now seen corresponding path program 1 times [2021-10-28 22:59:05,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:05,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653886731] [2021-10-28 22:59:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:05,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:05,717 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-28 22:59:05,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:05,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653886731] [2021-10-28 22:59:05,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653886731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:05,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:05,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:05,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880316457] [2021-10-28 22:59:05,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:05,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:05,722 INFO L87 Difference]: Start difference. First operand 421 states and 651 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-28 22:59:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:05,783 INFO L93 Difference]: Finished difference Result 1241 states and 1924 transitions. [2021-10-28 22:59:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:05,783 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-28 22:59:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:05,789 INFO L225 Difference]: With dead ends: 1241 [2021-10-28 22:59:05,790 INFO L226 Difference]: Without dead ends: 830 [2021-10-28 22:59:05,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-10-28 22:59:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 425. [2021-10-28 22:59:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 397 states have (on average 1.649874055415617) internal successors, (655), 424 states have internal predecessors, (655), 0 states have call successors, (0), 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-28 22:59:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 655 transitions. [2021-10-28 22:59:05,810 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 655 transitions. Word has length 14 [2021-10-28 22:59:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:05,811 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 655 transitions. [2021-10-28 22:59:05,811 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-28 22:59:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 655 transitions. [2021-10-28 22:59:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 22:59:05,812 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:05,813 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:05,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:59:05,813 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-28 22:59:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2021-10-28 22:59:05,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:05,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218157780] [2021-10-28 22:59:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:05,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:05,872 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-28 22:59:05,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:05,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218157780] [2021-10-28 22:59:05,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218157780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:05,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:05,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:05,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344280554] [2021-10-28 22:59:05,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:05,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:05,876 INFO L87 Difference]: Start difference. First operand 425 states and 655 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-28 22:59:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:05,991 INFO L93 Difference]: Finished difference Result 1564 states and 2392 transitions. [2021-10-28 22:59:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:05,992 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-28 22:59:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:06,001 INFO L225 Difference]: With dead ends: 1564 [2021-10-28 22:59:06,001 INFO L226 Difference]: Without dead ends: 1153 [2021-10-28 22:59:06,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-10-28 22:59:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 427. [2021-10-28 22:59:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 399 states have (on average 1.6466165413533835) internal successors, (657), 426 states have internal predecessors, (657), 0 states have call successors, (0), 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-28 22:59:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 657 transitions. [2021-10-28 22:59:06,033 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 657 transitions. Word has length 18 [2021-10-28 22:59:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:06,033 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 657 transitions. [2021-10-28 22:59:06,034 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-28 22:59:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 657 transitions. [2021-10-28 22:59:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 22:59:06,036 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:06,036 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:06,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:59:06,037 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-28 22:59:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1707916525, now seen corresponding path program 1 times [2021-10-28 22:59:06,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:06,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56199096] [2021-10-28 22:59:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:06,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:06,142 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-28 22:59:06,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:06,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56199096] [2021-10-28 22:59:06,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56199096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:06,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:06,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:06,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637032070] [2021-10-28 22:59:06,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:06,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:06,147 INFO L87 Difference]: Start difference. First operand 427 states and 657 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-28 22:59:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:06,195 INFO L93 Difference]: Finished difference Result 904 states and 1380 transitions. [2021-10-28 22:59:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:06,196 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-28 22:59:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:06,201 INFO L225 Difference]: With dead ends: 904 [2021-10-28 22:59:06,202 INFO L226 Difference]: Without dead ends: 662 [2021-10-28 22:59:06,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-10-28 22:59:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 425. [2021-10-28 22:59:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 397 states have (on average 1.63727959697733) internal successors, (650), 424 states have internal predecessors, (650), 0 states have call successors, (0), 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-28 22:59:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 650 transitions. [2021-10-28 22:59:06,224 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 650 transitions. Word has length 19 [2021-10-28 22:59:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:06,225 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 650 transitions. [2021-10-28 22:59:06,225 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-28 22:59:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 650 transitions. [2021-10-28 22:59:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 22:59:06,230 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:06,230 INFO L513 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-28 22:59:06,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:59:06,231 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-28 22:59:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2021-10-28 22:59:06,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:06,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364696601] [2021-10-28 22:59:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:06,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:06,314 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-28 22:59:06,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:06,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364696601] [2021-10-28 22:59:06,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364696601] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:06,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507174248] [2021-10-28 22:59:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:06,318 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:06,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:06,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 22:59:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:06,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-28 22:59:06,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:06,655 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-28 22:59:06,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507174248] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:06,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:06,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-28 22:59:06,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36463431] [2021-10-28 22:59:06,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:06,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:06,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:06,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:06,662 INFO L87 Difference]: Start difference. First operand 425 states and 650 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-28 22:59:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:06,782 INFO L93 Difference]: Finished difference Result 1655 states and 2545 transitions. [2021-10-28 22:59:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:06,782 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-28 22:59:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:06,791 INFO L225 Difference]: With dead ends: 1655 [2021-10-28 22:59:06,792 INFO L226 Difference]: Without dead ends: 1241 [2021-10-28 22:59:06,793 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-10-28 22:59:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 571. [2021-10-28 22:59:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 543 states have (on average 1.6574585635359116) internal successors, (900), 570 states have internal predecessors, (900), 0 states have call successors, (0), 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-28 22:59:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 900 transitions. [2021-10-28 22:59:06,824 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 900 transitions. Word has length 21 [2021-10-28 22:59:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:06,825 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 900 transitions. [2021-10-28 22:59:06,825 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-28 22:59:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 900 transitions. [2021-10-28 22:59:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-28 22:59:06,827 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:06,827 INFO L513 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-28 22:59:06,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-28 22:59:07,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-28 22:59:07,054 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-28 22:59:07,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1165168607, now seen corresponding path program 2 times [2021-10-28 22:59:07,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198410240] [2021-10-28 22:59:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,088 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-28 22:59:07,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198410240] [2021-10-28 22:59:07,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198410240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:07,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672261031] [2021-10-28 22:59:07,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:07,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,091 INFO L87 Difference]: Start difference. First operand 571 states and 900 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-28 22:59:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,196 INFO L93 Difference]: Finished difference Result 1288 states and 2001 transitions. [2021-10-28 22:59:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:07,196 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-28 22:59:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,202 INFO L225 Difference]: With dead ends: 1288 [2021-10-28 22:59:07,203 INFO L226 Difference]: Without dead ends: 775 [2021-10-28 22:59:07,204 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-28 22:59:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 505. [2021-10-28 22:59:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 482 states have (on average 1.607883817427386) internal successors, (775), 504 states have internal predecessors, (775), 0 states have call successors, (0), 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-28 22:59:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 775 transitions. [2021-10-28 22:59:07,226 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 775 transitions. Word has length 28 [2021-10-28 22:59:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,227 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 775 transitions. [2021-10-28 22:59:07,227 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-28 22:59:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 775 transitions. [2021-10-28 22:59:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-28 22:59:07,228 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,228 INFO L513 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-28 22:59:07,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:59:07,229 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-28 22:59:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 777427029, now seen corresponding path program 1 times [2021-10-28 22:59:07,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059147890] [2021-10-28 22:59:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,264 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-28 22:59:07,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059147890] [2021-10-28 22:59:07,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059147890] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:07,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528958994] [2021-10-28 22:59:07,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:07,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,268 INFO L87 Difference]: Start difference. First operand 505 states and 775 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-28 22:59:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,322 INFO L93 Difference]: Finished difference Result 1156 states and 1760 transitions. [2021-10-28 22:59:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:07,323 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-28 22:59:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,328 INFO L225 Difference]: With dead ends: 1156 [2021-10-28 22:59:07,328 INFO L226 Difference]: Without dead ends: 682 [2021-10-28 22:59:07,329 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-10-28 22:59:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 454. [2021-10-28 22:59:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.5727482678983833) internal successors, (681), 453 states have internal predecessors, (681), 0 states have call successors, (0), 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-28 22:59:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 681 transitions. [2021-10-28 22:59:07,356 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 681 transitions. Word has length 28 [2021-10-28 22:59:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 681 transitions. [2021-10-28 22:59:07,357 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-28 22:59:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 681 transitions. [2021-10-28 22:59:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 22:59:07,358 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,358 INFO L513 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-28 22:59:07,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:59:07,359 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-28 22:59:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 104948594, now seen corresponding path program 1 times [2021-10-28 22:59:07,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408476899] [2021-10-28 22:59:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,400 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-28 22:59:07,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408476899] [2021-10-28 22:59:07,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408476899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:07,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593155412] [2021-10-28 22:59:07,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:07,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:07,403 INFO L87 Difference]: Start difference. First operand 454 states and 681 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-28 22:59:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,454 INFO L93 Difference]: Finished difference Result 1090 states and 1641 transitions. [2021-10-28 22:59:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:07,455 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-28 22:59:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,460 INFO L225 Difference]: With dead ends: 1090 [2021-10-28 22:59:07,460 INFO L226 Difference]: Without dead ends: 680 [2021-10-28 22:59:07,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-10-28 22:59:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 454. [2021-10-28 22:59:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.5681293302540416) internal successors, (679), 453 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 679 transitions. [2021-10-28 22:59:07,478 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 679 transitions. Word has length 38 [2021-10-28 22:59:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,479 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 679 transitions. [2021-10-28 22:59:07,479 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-28 22:59:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 679 transitions. [2021-10-28 22:59:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:59:07,480 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,480 INFO L513 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-28 22:59:07,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:59:07,481 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-28 22:59:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1338937392, now seen corresponding path program 1 times [2021-10-28 22:59:07,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389226774] [2021-10-28 22:59:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,522 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-28 22:59:07,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389226774] [2021-10-28 22:59:07,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389226774] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:07,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944409285] [2021-10-28 22:59:07,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:07,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,526 INFO L87 Difference]: Start difference. First operand 454 states and 679 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-28 22:59:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,567 INFO L93 Difference]: Finished difference Result 1026 states and 1540 transitions. [2021-10-28 22:59:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:07,568 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-28 22:59:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,572 INFO L225 Difference]: With dead ends: 1026 [2021-10-28 22:59:07,572 INFO L226 Difference]: Without dead ends: 635 [2021-10-28 22:59:07,573 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-10-28 22:59:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 410. [2021-10-28 22:59:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 390 states have (on average 1.5512820512820513) internal successors, (605), 409 states have internal predecessors, (605), 0 states have call successors, (0), 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-28 22:59:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2021-10-28 22:59:07,589 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 50 [2021-10-28 22:59:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,589 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2021-10-28 22:59:07,590 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-28 22:59:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2021-10-28 22:59:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 22:59:07,591 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,591 INFO L513 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-28 22:59:07,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:59:07,591 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-28 22:59:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 970476669, now seen corresponding path program 1 times [2021-10-28 22:59:07,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646439747] [2021-10-28 22:59:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,631 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-28 22:59:07,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646439747] [2021-10-28 22:59:07,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646439747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:07,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662027958] [2021-10-28 22:59:07,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:07,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,634 INFO L87 Difference]: Start difference. First operand 410 states and 605 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-28 22:59:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,690 INFO L93 Difference]: Finished difference Result 860 states and 1269 transitions. [2021-10-28 22:59:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:07,690 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-28 22:59:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,693 INFO L225 Difference]: With dead ends: 860 [2021-10-28 22:59:07,694 INFO L226 Difference]: Without dead ends: 505 [2021-10-28 22:59:07,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-28 22:59:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 366. [2021-10-28 22:59:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 350 states have (on average 1.477142857142857) internal successors, (517), 365 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 517 transitions. [2021-10-28 22:59:07,709 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 517 transitions. Word has length 51 [2021-10-28 22:59:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,709 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 517 transitions. [2021-10-28 22:59:07,710 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-28 22:59:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 517 transitions. [2021-10-28 22:59:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-28 22:59:07,711 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,711 INFO L513 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-28 22:59:07,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:59:07,711 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-28 22:59:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash 216341264, now seen corresponding path program 1 times [2021-10-28 22:59:07,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718183577] [2021-10-28 22:59:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,796 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-28 22:59:07,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718183577] [2021-10-28 22:59:07,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718183577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:07,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817939070] [2021-10-28 22:59:07,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:07,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:07,800 INFO L87 Difference]: Start difference. First operand 366 states and 517 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-28 22:59:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,842 INFO L93 Difference]: Finished difference Result 868 states and 1248 transitions. [2021-10-28 22:59:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:07,845 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-28 22:59:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,850 INFO L225 Difference]: With dead ends: 868 [2021-10-28 22:59:07,850 INFO L226 Difference]: Without dead ends: 574 [2021-10-28 22:59:07,851 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-28 22:59:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 366. [2021-10-28 22:59:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 350 states have (on average 1.4714285714285715) internal successors, (515), 365 states have internal predecessors, (515), 0 states have call successors, (0), 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-28 22:59:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 515 transitions. [2021-10-28 22:59:07,867 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 515 transitions. Word has length 62 [2021-10-28 22:59:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:07,869 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 515 transitions. [2021-10-28 22:59:07,869 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-28 22:59:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2021-10-28 22:59:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-28 22:59:07,870 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:07,870 INFO L513 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-28 22:59:07,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:59:07,872 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-28 22:59:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash 542276843, now seen corresponding path program 1 times [2021-10-28 22:59:07,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:07,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103898402] [2021-10-28 22:59:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:07,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:07,936 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-28 22:59:07,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:07,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103898402] [2021-10-28 22:59:07,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103898402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:07,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:07,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:07,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474641236] [2021-10-28 22:59:07,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:07,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,942 INFO L87 Difference]: Start difference. First operand 366 states and 515 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-28 22:59:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:07,982 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2021-10-28 22:59:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:07,983 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-28 22:59:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:07,986 INFO L225 Difference]: With dead ends: 718 [2021-10-28 22:59:07,986 INFO L226 Difference]: Without dead ends: 458 [2021-10-28 22:59:07,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-28 22:59:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 324. [2021-10-28 22:59:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 318 states have (on average 1.449685534591195) internal successors, (461), 323 states have internal predecessors, (461), 0 states have call successors, (0), 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-28 22:59:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 461 transitions. [2021-10-28 22:59:08,003 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 461 transitions. Word has length 76 [2021-10-28 22:59:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,004 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 461 transitions. [2021-10-28 22:59:08,004 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-28 22:59:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 461 transitions. [2021-10-28 22:59:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-28 22:59:08,005 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,006 INFO L513 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-28 22:59:08,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:59:08,006 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-28 22:59:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash -532838176, now seen corresponding path program 1 times [2021-10-28 22:59:08,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637260891] [2021-10-28 22:59:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,067 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-28 22:59:08,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637260891] [2021-10-28 22:59:08,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637260891] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:08,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79854351] [2021-10-28 22:59:08,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:08,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,071 INFO L87 Difference]: Start difference. First operand 324 states and 461 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-28 22:59:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,097 INFO L93 Difference]: Finished difference Result 510 states and 741 transitions. [2021-10-28 22:59:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:08,098 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-28 22:59:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,100 INFO L225 Difference]: With dead ends: 510 [2021-10-28 22:59:08,100 INFO L226 Difference]: Without dead ends: 270 [2021-10-28 22:59:08,101 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-28 22:59:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-28 22:59:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4318181818181819) internal successors, (378), 269 states have internal predecessors, (378), 0 states have call successors, (0), 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-28 22:59:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2021-10-28 22:59:08,112 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 85 [2021-10-28 22:59:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,112 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2021-10-28 22:59:08,112 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-28 22:59:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2021-10-28 22:59:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-28 22:59:08,120 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,120 INFO L513 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-28 22:59:08,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:59:08,120 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-28 22:59:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1722161102, now seen corresponding path program 1 times [2021-10-28 22:59:08,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249702030] [2021-10-28 22:59:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,182 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-28 22:59:08,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249702030] [2021-10-28 22:59:08,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249702030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:08,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130512277] [2021-10-28 22:59:08,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:08,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:08,187 INFO L87 Difference]: Start difference. First operand 270 states and 378 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-28 22:59:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,218 INFO L93 Difference]: Finished difference Result 442 states and 636 transitions. [2021-10-28 22:59:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:08,219 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-28 22:59:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,221 INFO L225 Difference]: With dead ends: 442 [2021-10-28 22:59:08,221 INFO L226 Difference]: Without dead ends: 270 [2021-10-28 22:59:08,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-28 22:59:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-28 22:59:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4242424242424243) internal successors, (376), 269 states have internal predecessors, (376), 0 states have call successors, (0), 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-28 22:59:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 376 transitions. [2021-10-28 22:59:08,244 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 376 transitions. Word has length 88 [2021-10-28 22:59:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,244 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 376 transitions. [2021-10-28 22:59:08,245 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-28 22:59:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 376 transitions. [2021-10-28 22:59:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-28 22:59:08,246 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,246 INFO L513 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-28 22:59:08,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:59:08,247 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-28 22:59:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 621115599, now seen corresponding path program 1 times [2021-10-28 22:59:08,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843095960] [2021-10-28 22:59:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,302 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-28 22:59:08,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843095960] [2021-10-28 22:59:08,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843095960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:08,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344143464] [2021-10-28 22:59:08,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:08,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,308 INFO L87 Difference]: Start difference. First operand 270 states and 376 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-28 22:59:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,335 INFO L93 Difference]: Finished difference Result 571 states and 833 transitions. [2021-10-28 22:59:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:08,336 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-28 22:59:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,339 INFO L225 Difference]: With dead ends: 571 [2021-10-28 22:59:08,339 INFO L226 Difference]: Without dead ends: 404 [2021-10-28 22:59:08,340 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-10-28 22:59:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 265. [2021-10-28 22:59:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.4153846153846155) internal successors, (368), 264 states have internal predecessors, (368), 0 states have call successors, (0), 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-28 22:59:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 368 transitions. [2021-10-28 22:59:08,352 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 368 transitions. Word has length 101 [2021-10-28 22:59:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,352 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 368 transitions. [2021-10-28 22:59:08,352 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-28 22:59:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 368 transitions. [2021-10-28 22:59:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-28 22:59:08,354 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,354 INFO L513 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-28 22:59:08,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 22:59:08,355 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-28 22:59:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2003384041, now seen corresponding path program 1 times [2021-10-28 22:59:08,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716647687] [2021-10-28 22:59:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,414 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-28 22:59:08,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716647687] [2021-10-28 22:59:08,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716647687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:08,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083426896] [2021-10-28 22:59:08,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:08,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,417 INFO L87 Difference]: Start difference. First operand 265 states and 368 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-28 22:59:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,446 INFO L93 Difference]: Finished difference Result 552 states and 804 transitions. [2021-10-28 22:59:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:08,449 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-28 22:59:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,452 INFO L225 Difference]: With dead ends: 552 [2021-10-28 22:59:08,452 INFO L226 Difference]: Without dead ends: 390 [2021-10-28 22:59:08,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-28 22:59:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2021-10-28 22:59:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.404669260700389) internal successors, (361), 260 states have internal predecessors, (361), 0 states have call successors, (0), 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-28 22:59:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 361 transitions. [2021-10-28 22:59:08,465 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 361 transitions. Word has length 106 [2021-10-28 22:59:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,466 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 361 transitions. [2021-10-28 22:59:08,466 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-28 22:59:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 361 transitions. [2021-10-28 22:59:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-28 22:59:08,467 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,468 INFO L513 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-28 22:59:08,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 22:59:08,468 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-28 22:59:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2064909061, now seen corresponding path program 1 times [2021-10-28 22:59:08,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778835376] [2021-10-28 22:59:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,524 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-28 22:59:08,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778835376] [2021-10-28 22:59:08,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778835376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:08,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183177655] [2021-10-28 22:59:08,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:08,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,528 INFO L87 Difference]: Start difference. First operand 261 states and 361 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-28 22:59:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,549 INFO L93 Difference]: Finished difference Result 417 states and 597 transitions. [2021-10-28 22:59:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:08,550 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-28 22:59:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,552 INFO L225 Difference]: With dead ends: 417 [2021-10-28 22:59:08,552 INFO L226 Difference]: Without dead ends: 259 [2021-10-28 22:59:08,553 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-28 22:59:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-10-28 22:59:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 255 states have (on average 1.392156862745098) internal successors, (355), 257 states have internal predecessors, (355), 0 states have call successors, (0), 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-28 22:59:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2021-10-28 22:59:08,564 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 112 [2021-10-28 22:59:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,564 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2021-10-28 22:59:08,564 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-28 22:59:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2021-10-28 22:59:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-28 22:59:08,566 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,566 INFO L513 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-28 22:59:08,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 22:59:08,566 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-28 22:59:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash 774981206, now seen corresponding path program 1 times [2021-10-28 22:59:08,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748650578] [2021-10-28 22:59:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,622 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-28 22:59:08,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748650578] [2021-10-28 22:59:08,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748650578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:08,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:08,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:08,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118604325] [2021-10-28 22:59:08,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:08,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,626 INFO L87 Difference]: Start difference. First operand 258 states and 355 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-28 22:59:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:08,646 INFO L93 Difference]: Finished difference Result 459 states and 656 transitions. [2021-10-28 22:59:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:08,646 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-28 22:59:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:08,649 INFO L225 Difference]: With dead ends: 459 [2021-10-28 22:59:08,649 INFO L226 Difference]: Without dead ends: 304 [2021-10-28 22:59:08,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-10-28 22:59:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 255. [2021-10-28 22:59:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 253 states have (on average 1.3873517786561265) internal successors, (351), 254 states have internal predecessors, (351), 0 states have call successors, (0), 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-28 22:59:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 351 transitions. [2021-10-28 22:59:08,666 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 351 transitions. Word has length 119 [2021-10-28 22:59:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:08,666 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 351 transitions. [2021-10-28 22:59:08,667 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-28 22:59:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 351 transitions. [2021-10-28 22:59:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-28 22:59:08,668 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:08,668 INFO L513 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-28 22:59:08,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 22:59:08,669 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-28 22:59:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1814887070, now seen corresponding path program 1 times [2021-10-28 22:59:08,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:08,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537390681] [2021-10-28 22:59:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,740 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-28 22:59:08,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:08,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537390681] [2021-10-28 22:59:08,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537390681] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:08,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238243383] [2021-10-28 22:59:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:08,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:08,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:08,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:08,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 22:59:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:08,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 22:59:08,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:09,241 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-28 22:59:09,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238243383] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:09,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:09,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-28 22:59:09,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748190102] [2021-10-28 22:59:09,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:59:09,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:09,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:59:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:09,245 INFO L87 Difference]: Start difference. First operand 255 states and 351 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-28 22:59:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:09,319 INFO L93 Difference]: Finished difference Result 532 states and 731 transitions. [2021-10-28 22:59:09,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:09,319 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-28 22:59:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:09,321 INFO L225 Difference]: With dead ends: 532 [2021-10-28 22:59:09,322 INFO L226 Difference]: Without dead ends: 296 [2021-10-28 22:59:09,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-28 22:59:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-10-28 22:59:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 294 states have (on average 1.3605442176870748) internal successors, (400), 295 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 400 transitions. [2021-10-28 22:59:09,337 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 400 transitions. Word has length 122 [2021-10-28 22:59:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:09,338 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 400 transitions. [2021-10-28 22:59:09,338 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-28 22:59:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2021-10-28 22:59:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-28 22:59:09,340 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:09,341 INFO L513 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-28 22:59:09,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 22:59:09,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:09,561 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-28 22:59:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2087750763, now seen corresponding path program 2 times [2021-10-28 22:59:09,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:09,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127470902] [2021-10-28 22:59:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:09,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:09,684 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-28 22:59:09,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:09,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127470902] [2021-10-28 22:59:09,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127470902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:09,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:09,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:09,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891570113] [2021-10-28 22:59:09,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:09,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:09,689 INFO L87 Difference]: Start difference. First operand 296 states and 400 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-28 22:59:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:09,804 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2021-10-28 22:59:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:09,804 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-28 22:59:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:09,808 INFO L225 Difference]: With dead ends: 624 [2021-10-28 22:59:09,808 INFO L226 Difference]: Without dead ends: 472 [2021-10-28 22:59:09,809 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-28 22:59:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 378. [2021-10-28 22:59:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 376 states have (on average 1.377659574468085) internal successors, (518), 377 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-28 22:59:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2021-10-28 22:59:09,829 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 159 [2021-10-28 22:59:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:09,829 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2021-10-28 22:59:09,830 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-28 22:59:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2021-10-28 22:59:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-28 22:59:09,832 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:09,832 INFO L513 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] [2021-10-28 22:59:09,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 22:59:09,833 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-28 22:59:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1509135504, now seen corresponding path program 1 times [2021-10-28 22:59:09,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:09,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364833567] [2021-10-28 22:59:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:09,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:09,908 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-28 22:59:09,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:09,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364833567] [2021-10-28 22:59:09,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364833567] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:09,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:09,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:09,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557855675] [2021-10-28 22:59:09,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:09,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:09,913 INFO L87 Difference]: Start difference. First operand 378 states and 518 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-28 22:59:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:09,956 INFO L93 Difference]: Finished difference Result 783 states and 1118 transitions. [2021-10-28 22:59:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 176 [2021-10-28 22:59:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:09,961 INFO L225 Difference]: With dead ends: 783 [2021-10-28 22:59:09,961 INFO L226 Difference]: Without dead ends: 587 [2021-10-28 22:59:09,962 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-10-28 22:59:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 448. [2021-10-28 22:59:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 446 states have (on average 1.383408071748879) internal successors, (617), 447 states have internal predecessors, (617), 0 states have call successors, (0), 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-28 22:59:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 617 transitions. [2021-10-28 22:59:10,001 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 617 transitions. Word has length 176 [2021-10-28 22:59:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:10,002 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 617 transitions. [2021-10-28 22:59:10,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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-28 22:59:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 617 transitions. [2021-10-28 22:59:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-28 22:59:10,005 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:10,005 INFO L513 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-28 22:59:10,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 22:59:10,006 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-28 22:59:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1608082732, now seen corresponding path program 1 times [2021-10-28 22:59:10,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:10,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213735648] [2021-10-28 22:59:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:10,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:10,105 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-28 22:59:10,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:10,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213735648] [2021-10-28 22:59:10,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213735648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:10,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:10,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:10,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880468941] [2021-10-28 22:59:10,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:10,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:10,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:10,108 INFO L87 Difference]: Start difference. First operand 448 states and 617 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-28 22:59:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:10,158 INFO L93 Difference]: Finished difference Result 932 states and 1331 transitions. [2021-10-28 22:59:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:10,159 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-28 22:59:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:10,164 INFO L225 Difference]: With dead ends: 932 [2021-10-28 22:59:10,164 INFO L226 Difference]: Without dead ends: 693 [2021-10-28 22:59:10,165 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-28 22:59:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 542. [2021-10-28 22:59:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 540 states have (on average 1.3907407407407408) internal successors, (751), 541 states have internal predecessors, (751), 0 states have call successors, (0), 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-28 22:59:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 751 transitions. [2021-10-28 22:59:10,225 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 751 transitions. Word has length 177 [2021-10-28 22:59:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:10,225 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 751 transitions. [2021-10-28 22:59:10,226 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-28 22:59:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 751 transitions. [2021-10-28 22:59:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-28 22:59:10,228 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:10,229 INFO L513 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-28 22:59:10,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 22:59:10,229 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-28 22:59:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1599154325, now seen corresponding path program 1 times [2021-10-28 22:59:10,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:10,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084013025] [2021-10-28 22:59:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:10,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:10,325 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-28 22:59:10,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:10,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084013025] [2021-10-28 22:59:10,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084013025] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:10,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:10,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:10,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124118863] [2021-10-28 22:59:10,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:10,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:10,328 INFO L87 Difference]: Start difference. First operand 542 states and 751 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-28 22:59:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:10,391 INFO L93 Difference]: Finished difference Result 1108 states and 1589 transitions. [2021-10-28 22:59:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:10,392 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-28 22:59:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:10,397 INFO L225 Difference]: With dead ends: 1108 [2021-10-28 22:59:10,397 INFO L226 Difference]: Without dead ends: 805 [2021-10-28 22:59:10,398 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-28 22:59:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 628. [2021-10-28 22:59:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.404153354632588) internal successors, (879), 627 states have internal predecessors, (879), 0 states have call successors, (0), 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-28 22:59:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 879 transitions. [2021-10-28 22:59:10,439 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 879 transitions. Word has length 178 [2021-10-28 22:59:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:10,440 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 879 transitions. [2021-10-28 22:59:10,440 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-28 22:59:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 879 transitions. [2021-10-28 22:59:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-28 22:59:10,443 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:10,443 INFO L513 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-28 22:59:10,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 22:59:10,443 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-28 22:59:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2021856151, now seen corresponding path program 1 times [2021-10-28 22:59:10,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:10,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451472073] [2021-10-28 22:59:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:10,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:10,548 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-28 22:59:10,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:10,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451472073] [2021-10-28 22:59:10,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451472073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:10,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:10,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:59:10,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741628416] [2021-10-28 22:59:10,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:10,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:10,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:10,551 INFO L87 Difference]: Start difference. First operand 628 states and 879 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 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-28 22:59:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:10,734 INFO L93 Difference]: Finished difference Result 1256 states and 1747 transitions. [2021-10-28 22:59:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:59:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 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-28 22:59:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:10,742 INFO L225 Difference]: With dead ends: 1256 [2021-10-28 22:59:10,742 INFO L226 Difference]: Without dead ends: 875 [2021-10-28 22:59:10,743 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:59:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-10-28 22:59:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 628. [2021-10-28 22:59:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.389776357827476) internal successors, (870), 627 states have internal predecessors, (870), 0 states have call successors, (0), 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-28 22:59:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2021-10-28 22:59:10,833 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2021-10-28 22:59:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:10,834 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2021-10-28 22:59:10,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 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-28 22:59:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2021-10-28 22:59:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-28 22:59:10,837 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:10,838 INFO L513 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-28 22:59:10,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 22:59:10,840 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-28 22:59:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1934782051, now seen corresponding path program 1 times [2021-10-28 22:59:10,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:10,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002276602] [2021-10-28 22:59:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:10,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:10,947 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-28 22:59:10,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:10,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002276602] [2021-10-28 22:59:10,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002276602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:10,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:10,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:59:10,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471117744] [2021-10-28 22:59:10,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:10,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:10,954 INFO L87 Difference]: Start difference. First operand 628 states and 870 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-28 22:59:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:11,136 INFO L93 Difference]: Finished difference Result 1481 states and 2092 transitions. [2021-10-28 22:59:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:59:11,137 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-28 22:59:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:11,145 INFO L225 Difference]: With dead ends: 1481 [2021-10-28 22:59:11,145 INFO L226 Difference]: Without dead ends: 1100 [2021-10-28 22:59:11,146 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:59:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-10-28 22:59:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 628. [2021-10-28 22:59:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.3881789137380192) internal successors, (869), 627 states have internal predecessors, (869), 0 states have call successors, (0), 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-28 22:59:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2021-10-28 22:59:11,201 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 179 [2021-10-28 22:59:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:11,202 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2021-10-28 22:59:11,202 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-28 22:59:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2021-10-28 22:59:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-28 22:59:11,205 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:11,206 INFO L513 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-28 22:59:11,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 22:59:11,206 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-28 22:59:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 356758881, now seen corresponding path program 1 times [2021-10-28 22:59:11,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:11,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756052875] [2021-10-28 22:59:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:11,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:11,326 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-28 22:59:11,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:11,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756052875] [2021-10-28 22:59:11,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756052875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:11,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:11,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:11,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637355427] [2021-10-28 22:59:11,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:11,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:11,330 INFO L87 Difference]: Start difference. First operand 628 states and 869 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-28 22:59:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:11,410 INFO L93 Difference]: Finished difference Result 1011 states and 1430 transitions. [2021-10-28 22:59:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-28 22:59:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:11,434 INFO L225 Difference]: With dead ends: 1011 [2021-10-28 22:59:11,435 INFO L226 Difference]: Without dead ends: 610 [2021-10-28 22:59:11,435 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-28 22:59:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2021-10-28 22:59:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 1.3733552631578947) internal successors, (835), 609 states have internal predecessors, (835), 0 states have call successors, (0), 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-28 22:59:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 835 transitions. [2021-10-28 22:59:11,488 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 835 transitions. Word has length 180 [2021-10-28 22:59:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:11,489 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 835 transitions. [2021-10-28 22:59:11,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-28 22:59:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 835 transitions. [2021-10-28 22:59:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-28 22:59:11,492 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:11,492 INFO L513 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-28 22:59:11,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 22:59:11,493 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-28 22:59:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash -970239779, now seen corresponding path program 1 times [2021-10-28 22:59:11,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:11,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777645733] [2021-10-28 22:59:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:11,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:11,639 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-28 22:59:11,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:11,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777645733] [2021-10-28 22:59:11,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777645733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:11,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:11,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:59:11,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363126880] [2021-10-28 22:59:11,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:59:11,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:59:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:11,642 INFO L87 Difference]: Start difference. First operand 610 states and 835 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-28 22:59:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:11,815 INFO L93 Difference]: Finished difference Result 1000 states and 1388 transitions. [2021-10-28 22:59:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 22:59:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-28 22:59:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:11,822 INFO L225 Difference]: With dead ends: 1000 [2021-10-28 22:59:11,823 INFO L226 Difference]: Without dead ends: 998 [2021-10-28 22:59:11,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-28 22:59:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-10-28 22:59:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 612. [2021-10-28 22:59:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 610 states have (on average 1.3721311475409836) internal successors, (837), 611 states have internal predecessors, (837), 0 states have call successors, (0), 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-28 22:59:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 837 transitions. [2021-10-28 22:59:11,878 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 837 transitions. Word has length 180 [2021-10-28 22:59:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:11,878 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 837 transitions. [2021-10-28 22:59:11,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-28 22:59:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 837 transitions. [2021-10-28 22:59:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-28 22:59:11,881 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:11,881 INFO L513 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] [2021-10-28 22:59:11,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 22:59:11,882 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-28 22:59:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1672767509, now seen corresponding path program 1 times [2021-10-28 22:59:11,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:11,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387901739] [2021-10-28 22:59:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:11,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:12,055 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-28 22:59:12,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:12,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387901739] [2021-10-28 22:59:12,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387901739] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:12,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038564321] [2021-10-28 22:59:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:12,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:12,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:12,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 22:59:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:12,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 22:59:12,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:12,950 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-28 22:59:12,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038564321] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:12,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:12,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-10-28 22:59:12,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145335250] [2021-10-28 22:59:12,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 22:59:12,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 22:59:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-28 22:59:12,953 INFO L87 Difference]: Start difference. First operand 612 states and 837 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 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-28 22:59:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:13,757 INFO L93 Difference]: Finished difference Result 3671 states and 5205 transitions. [2021-10-28 22:59:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-28 22:59:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 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 183 [2021-10-28 22:59:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:13,777 INFO L225 Difference]: With dead ends: 3671 [2021-10-28 22:59:13,777 INFO L226 Difference]: Without dead ends: 3302 [2021-10-28 22:59:13,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-10-28 22:59:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2021-10-28 22:59:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 820. [2021-10-28 22:59:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 818 states have (on average 1.3508557457212713) internal successors, (1105), 819 states have internal predecessors, (1105), 0 states have call successors, (0), 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-28 22:59:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1105 transitions. [2021-10-28 22:59:13,862 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1105 transitions. Word has length 183 [2021-10-28 22:59:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:13,863 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1105 transitions. [2021-10-28 22:59:13,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 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-28 22:59:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2021-10-28 22:59:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-28 22:59:13,866 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:13,867 INFO L513 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] [2021-10-28 22:59:13,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 22:59:14,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-10-28 22:59:14,090 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-28 22:59:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1342336109, now seen corresponding path program 1 times [2021-10-28 22:59:14,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:14,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467876688] [2021-10-28 22:59:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:14,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:14,152 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-28 22:59:14,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:14,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467876688] [2021-10-28 22:59:14,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467876688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:14,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:14,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:14,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843387597] [2021-10-28 22:59:14,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:14,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:14,155 INFO L87 Difference]: Start difference. First operand 820 states and 1105 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-28 22:59:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:14,317 INFO L93 Difference]: Finished difference Result 1825 states and 2496 transitions. [2021-10-28 22:59:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 183 [2021-10-28 22:59:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:14,325 INFO L225 Difference]: With dead ends: 1825 [2021-10-28 22:59:14,326 INFO L226 Difference]: Without dead ends: 1456 [2021-10-28 22:59:14,327 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-10-28 22:59:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 820. [2021-10-28 22:59:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 818 states have (on average 1.3484107579462103) internal successors, (1103), 819 states have internal predecessors, (1103), 0 states have call successors, (0), 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-28 22:59:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1103 transitions. [2021-10-28 22:59:14,395 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1103 transitions. Word has length 183 [2021-10-28 22:59:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:14,396 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1103 transitions. [2021-10-28 22:59:14,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-28 22:59:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1103 transitions. [2021-10-28 22:59:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-28 22:59:14,399 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:14,400 INFO L513 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] [2021-10-28 22:59:14,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 22:59:14,400 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-28 22:59:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -759019257, now seen corresponding path program 1 times [2021-10-28 22:59:14,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:14,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138795336] [2021-10-28 22:59:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:14,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:14,447 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-28 22:59:14,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:14,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138795336] [2021-10-28 22:59:14,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138795336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:14,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:14,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:14,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736420333] [2021-10-28 22:59:14,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:14,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:14,450 INFO L87 Difference]: Start difference. First operand 820 states and 1103 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:14,525 INFO L93 Difference]: Finished difference Result 1372 states and 1859 transitions. [2021-10-28 22:59:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 186 [2021-10-28 22:59:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:14,530 INFO L225 Difference]: With dead ends: 1372 [2021-10-28 22:59:14,530 INFO L226 Difference]: Without dead ends: 673 [2021-10-28 22:59:14,531 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-28 22:59:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2021-10-28 22:59:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 670 states have (on average 1.3164179104477611) internal successors, (882), 671 states have internal predecessors, (882), 0 states have call successors, (0), 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-28 22:59:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 882 transitions. [2021-10-28 22:59:14,582 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 882 transitions. Word has length 186 [2021-10-28 22:59:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:14,583 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 882 transitions. [2021-10-28 22:59:14,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 882 transitions. [2021-10-28 22:59:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-28 22:59:14,586 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:14,586 INFO L513 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] [2021-10-28 22:59:14,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 22:59:14,587 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-28 22:59:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1115601649, now seen corresponding path program 1 times [2021-10-28 22:59:14,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:14,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805208704] [2021-10-28 22:59:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:14,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:14,731 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-28 22:59:14,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:14,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805208704] [2021-10-28 22:59:14,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805208704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:14,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:14,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:59:14,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102371166] [2021-10-28 22:59:14,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:59:14,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:59:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:59:14,734 INFO L87 Difference]: Start difference. First operand 672 states and 882 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:15,069 INFO L93 Difference]: Finished difference Result 1442 states and 1925 transitions. [2021-10-28 22:59:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:59:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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 191 [2021-10-28 22:59:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:15,077 INFO L225 Difference]: With dead ends: 1442 [2021-10-28 22:59:15,077 INFO L226 Difference]: Without dead ends: 1084 [2021-10-28 22:59:15,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 22:59:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-10-28 22:59:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 780. [2021-10-28 22:59:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 778 states have (on average 1.30719794344473) internal successors, (1017), 779 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1017 transitions. [2021-10-28 22:59:15,147 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1017 transitions. Word has length 191 [2021-10-28 22:59:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:15,148 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1017 transitions. [2021-10-28 22:59:15,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1017 transitions. [2021-10-28 22:59:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-28 22:59:15,151 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:15,151 INFO L513 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] [2021-10-28 22:59:15,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 22:59:15,152 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-28 22:59:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1484290453, now seen corresponding path program 1 times [2021-10-28 22:59:15,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:15,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692833629] [2021-10-28 22:59:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:15,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:15,240 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-28 22:59:15,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:15,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692833629] [2021-10-28 22:59:15,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692833629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:15,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:15,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:59:15,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882605558] [2021-10-28 22:59:15,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:59:15,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:59:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:15,243 INFO L87 Difference]: Start difference. First operand 780 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:15,479 INFO L93 Difference]: Finished difference Result 2558 states and 3458 transitions. [2021-10-28 22:59:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:59:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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 197 [2021-10-28 22:59:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:15,492 INFO L225 Difference]: With dead ends: 2558 [2021-10-28 22:59:15,492 INFO L226 Difference]: Without dead ends: 2086 [2021-10-28 22:59:15,494 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2021-10-28 22:59:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 857. [2021-10-28 22:59:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.304093567251462) internal successors, (1115), 856 states have internal predecessors, (1115), 0 states have call successors, (0), 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-28 22:59:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1115 transitions. [2021-10-28 22:59:15,582 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1115 transitions. Word has length 197 [2021-10-28 22:59:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:15,583 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1115 transitions. [2021-10-28 22:59:15,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1115 transitions. [2021-10-28 22:59:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-28 22:59:15,587 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:15,587 INFO L513 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] [2021-10-28 22:59:15,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 22:59:15,588 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-28 22:59:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -725967573, now seen corresponding path program 1 times [2021-10-28 22:59:15,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:15,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999903860] [2021-10-28 22:59:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:15,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:15,731 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-28 22:59:15,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:15,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999903860] [2021-10-28 22:59:15,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999903860] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:15,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:15,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:59:15,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077110399] [2021-10-28 22:59:15,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:59:15,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:59:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:59:15,735 INFO L87 Difference]: Start difference. First operand 857 states and 1115 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:16,296 INFO L93 Difference]: Finished difference Result 2074 states and 2728 transitions. [2021-10-28 22:59:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 22:59:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 197 [2021-10-28 22:59:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:16,320 INFO L225 Difference]: With dead ends: 2074 [2021-10-28 22:59:16,320 INFO L226 Difference]: Without dead ends: 1528 [2021-10-28 22:59:16,322 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-28 22:59:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2021-10-28 22:59:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 912. [2021-10-28 22:59:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 910 states have (on average 1.2912087912087913) internal successors, (1175), 911 states have internal predecessors, (1175), 0 states have call successors, (0), 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-28 22:59:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1175 transitions. [2021-10-28 22:59:16,417 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1175 transitions. Word has length 197 [2021-10-28 22:59:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:16,418 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1175 transitions. [2021-10-28 22:59:16,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1175 transitions. [2021-10-28 22:59:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-28 22:59:16,421 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:16,422 INFO L513 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] [2021-10-28 22:59:16,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 22:59:16,422 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-28 22:59:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1846866791, now seen corresponding path program 1 times [2021-10-28 22:59:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:16,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773908170] [2021-10-28 22:59:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:16,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:16,589 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-28 22:59:16,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:16,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773908170] [2021-10-28 22:59:16,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773908170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:16,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:16,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:59:16,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654438077] [2021-10-28 22:59:16,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:59:16,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:16,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:59:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:59:16,593 INFO L87 Difference]: Start difference. First operand 912 states and 1175 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:17,072 INFO L93 Difference]: Finished difference Result 1900 states and 2488 transitions. [2021-10-28 22:59:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 22:59:17,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 197 [2021-10-28 22:59:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:17,076 INFO L225 Difference]: With dead ends: 1900 [2021-10-28 22:59:17,076 INFO L226 Difference]: Without dead ends: 1294 [2021-10-28 22:59:17,078 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-28 22:59:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-28 22:59:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 879. [2021-10-28 22:59:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.2930444697833523) internal successors, (1134), 878 states have internal predecessors, (1134), 0 states have call successors, (0), 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-28 22:59:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1134 transitions. [2021-10-28 22:59:17,161 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1134 transitions. Word has length 197 [2021-10-28 22:59:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:17,162 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 1134 transitions. [2021-10-28 22:59:17,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 22:59:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1134 transitions. [2021-10-28 22:59:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-28 22:59:17,165 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:17,166 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:17,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 22:59:17,166 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-28 22:59:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2030555812, now seen corresponding path program 1 times [2021-10-28 22:59:17,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:17,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366937600] [2021-10-28 22:59:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:17,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-10-28 22:59:17,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:17,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366937600] [2021-10-28 22:59:17,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366937600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:17,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:17,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:17,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338650409] [2021-10-28 22:59:17,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:17,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:17,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:17,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:17,241 INFO L87 Difference]: Start difference. First operand 879 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:17,449 INFO L93 Difference]: Finished difference Result 1596 states and 2088 transitions. [2021-10-28 22:59:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:17,454 INFO L225 Difference]: With dead ends: 1596 [2021-10-28 22:59:17,454 INFO L226 Difference]: Without dead ends: 1017 [2021-10-28 22:59:17,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-10-28 22:59:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 778. [2021-10-28 22:59:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.2754182754182755) internal successors, (991), 777 states have internal predecessors, (991), 0 states have call successors, (0), 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-28 22:59:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 991 transitions. [2021-10-28 22:59:17,542 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 991 transitions. Word has length 207 [2021-10-28 22:59:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:17,542 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 991 transitions. [2021-10-28 22:59:17,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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-28 22:59:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 991 transitions. [2021-10-28 22:59:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-28 22:59:17,547 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:17,547 INFO L513 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] [2021-10-28 22:59:17,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 22:59:17,547 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-28 22:59:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1428912634, now seen corresponding path program 1 times [2021-10-28 22:59:17,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:17,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327912287] [2021-10-28 22:59:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:17,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 22:59:17,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:17,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327912287] [2021-10-28 22:59:17,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327912287] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:17,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519974743] [2021-10-28 22:59:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:17,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:17,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:17,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-28 22:59:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:18,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-28 22:59:18,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-10-28 22:59:19,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519974743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:19,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 22:59:19,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 26 [2021-10-28 22:59:19,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071081286] [2021-10-28 22:59:19,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:59:19,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:59:19,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2021-10-28 22:59:19,192 INFO L87 Difference]: Start difference. First operand 778 states and 991 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-28 22:59:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:19,767 INFO L93 Difference]: Finished difference Result 2195 states and 2822 transitions. [2021-10-28 22:59:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 22:59:19,768 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 231 [2021-10-28 22:59:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:19,772 INFO L225 Difference]: With dead ends: 2195 [2021-10-28 22:59:19,772 INFO L226 Difference]: Without dead ends: 1731 [2021-10-28 22:59:19,774 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-28 22:59:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2021-10-28 22:59:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 814. [2021-10-28 22:59:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.2742927429274293) internal successors, (1036), 813 states have internal predecessors, (1036), 0 states have call successors, (0), 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-28 22:59:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1036 transitions. [2021-10-28 22:59:19,875 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1036 transitions. Word has length 231 [2021-10-28 22:59:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:19,876 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1036 transitions. [2021-10-28 22:59:19,876 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-28 22:59:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1036 transitions. [2021-10-28 22:59:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-28 22:59:19,880 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:19,881 INFO L513 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] [2021-10-28 22:59:19,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-28 22:59:20,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-28 22:59:20,102 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-28 22:59:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1486170936, now seen corresponding path program 1 times [2021-10-28 22:59:20,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:20,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434173008] [2021-10-28 22:59:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:20,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-10-28 22:59:20,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:20,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434173008] [2021-10-28 22:59:20,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434173008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:20,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:20,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:20,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260609788] [2021-10-28 22:59:20,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:20,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:20,206 INFO L87 Difference]: Start difference. First operand 814 states and 1036 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-28 22:59:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:20,360 INFO L93 Difference]: Finished difference Result 1579 states and 2001 transitions. [2021-10-28 22:59:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:20,361 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 231 [2021-10-28 22:59:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:20,364 INFO L225 Difference]: With dead ends: 1579 [2021-10-28 22:59:20,364 INFO L226 Difference]: Without dead ends: 1042 [2021-10-28 22:59:20,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2021-10-28 22:59:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 808. [2021-10-28 22:59:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.2478314745972738) internal successors, (1007), 807 states have internal predecessors, (1007), 0 states have call successors, (0), 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-28 22:59:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1007 transitions. [2021-10-28 22:59:20,479 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1007 transitions. Word has length 231 [2021-10-28 22:59:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:20,480 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1007 transitions. [2021-10-28 22:59:20,480 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-28 22:59:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1007 transitions. [2021-10-28 22:59:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-28 22:59:20,486 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:20,486 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:20,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 22:59:20,486 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-28 22:59:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1782231364, now seen corresponding path program 1 times [2021-10-28 22:59:20,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:20,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858715244] [2021-10-28 22:59:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:20,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 22:59:20,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:20,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858715244] [2021-10-28 22:59:20,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858715244] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:20,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354608596] [2021-10-28 22:59:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:20,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:20,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:20,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-28 22:59:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:21,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-28 22:59:21,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-10-28 22:59:22,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354608596] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:22,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:22,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2021-10-28 22:59:22,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450408780] [2021-10-28 22:59:22,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-28 22:59:22,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-28 22:59:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-10-28 22:59:22,133 INFO L87 Difference]: Start difference. First operand 808 states and 1007 transitions. Second operand has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 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-28 22:59:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:28,929 INFO L93 Difference]: Finished difference Result 5517 states and 7042 transitions. [2021-10-28 22:59:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-10-28 22:59:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 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 237 [2021-10-28 22:59:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:28,940 INFO L225 Difference]: With dead ends: 5517 [2021-10-28 22:59:28,940 INFO L226 Difference]: Without dead ends: 5017 [2021-10-28 22:59:28,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8443 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2584, Invalid=23498, Unknown=0, NotChecked=0, Total=26082 [2021-10-28 22:59:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2021-10-28 22:59:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 1662. [2021-10-28 22:59:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.2450331125827814) internal successors, (2068), 1661 states have internal predecessors, (2068), 0 states have call successors, (0), 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-28 22:59:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2068 transitions. [2021-10-28 22:59:29,178 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2068 transitions. Word has length 237 [2021-10-28 22:59:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:29,179 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 2068 transitions. [2021-10-28 22:59:29,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 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-28 22:59:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2068 transitions. [2021-10-28 22:59:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-10-28 22:59:29,184 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:29,184 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:29,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-28 22:59:29,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:29,401 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-28 22:59:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 155215879, now seen corresponding path program 1 times [2021-10-28 22:59:29,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:29,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352519166] [2021-10-28 22:59:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:29,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-10-28 22:59:29,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:29,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352519166] [2021-10-28 22:59:29,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352519166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:29,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:29,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:59:29,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50478398] [2021-10-28 22:59:29,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:59:29,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:59:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:29,463 INFO L87 Difference]: Start difference. First operand 1662 states and 2068 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-28 22:59:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:29,627 INFO L93 Difference]: Finished difference Result 2954 states and 3675 transitions. [2021-10-28 22:59:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:59:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-28 22:59:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:29,631 INFO L225 Difference]: With dead ends: 2954 [2021-10-28 22:59:29,631 INFO L226 Difference]: Without dead ends: 1305 [2021-10-28 22:59:29,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:59:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2021-10-28 22:59:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2021-10-28 22:59:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.236963190184049) internal successors, (1613), 1304 states have internal predecessors, (1613), 0 states have call successors, (0), 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-28 22:59:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1613 transitions. [2021-10-28 22:59:29,773 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1613 transitions. Word has length 240 [2021-10-28 22:59:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:29,773 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1613 transitions. [2021-10-28 22:59:29,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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-28 22:59:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1613 transitions. [2021-10-28 22:59:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-28 22:59:29,777 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:29,778 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:29,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-28 22:59:29,778 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-28 22:59:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash 930274956, now seen corresponding path program 1 times [2021-10-28 22:59:29,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:29,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950876690] [2021-10-28 22:59:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:29,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-10-28 22:59:29,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:29,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950876690] [2021-10-28 22:59:29,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950876690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:29,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:29,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:29,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980104206] [2021-10-28 22:59:29,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:29,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:29,873 INFO L87 Difference]: Start difference. First operand 1305 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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-28 22:59:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:30,076 INFO L93 Difference]: Finished difference Result 2224 states and 2765 transitions. [2021-10-28 22:59:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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-28 22:59:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:30,080 INFO L225 Difference]: With dead ends: 2224 [2021-10-28 22:59:30,080 INFO L226 Difference]: Without dead ends: 1314 [2021-10-28 22:59:30,081 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-28 22:59:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1311. [2021-10-28 22:59:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.2351145038167939) internal successors, (1618), 1310 states have internal predecessors, (1618), 0 states have call successors, (0), 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-28 22:59:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1618 transitions. [2021-10-28 22:59:30,226 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1618 transitions. Word has length 243 [2021-10-28 22:59:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:30,227 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1618 transitions. [2021-10-28 22:59:30,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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-28 22:59:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1618 transitions. [2021-10-28 22:59:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-10-28 22:59:30,231 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:30,231 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:30,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-28 22:59:30,232 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-28 22:59:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 312923408, now seen corresponding path program 1 times [2021-10-28 22:59:30,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:30,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167296657] [2021-10-28 22:59:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:30,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 22:59:30,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:30,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167296657] [2021-10-28 22:59:30,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167296657] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:30,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556719554] [2021-10-28 22:59:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:30,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:30,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:30,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-28 22:59:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:31,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-28 22:59:31,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-10-28 22:59:32,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556719554] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:32,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:32,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-10-28 22:59:32,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589870091] [2021-10-28 22:59:32,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-28 22:59:32,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-28 22:59:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-10-28 22:59:32,803 INFO L87 Difference]: Start difference. First operand 1311 states and 1618 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-28 22:59:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:50,904 INFO L93 Difference]: Finished difference Result 9864 states and 12523 transitions. [2021-10-28 22:59:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-10-28 22:59:50,905 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 244 [2021-10-28 22:59:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:50,929 INFO L225 Difference]: With dead ends: 9864 [2021-10-28 22:59:50,929 INFO L226 Difference]: Without dead ends: 8959 [2021-10-28 22:59:50,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19922 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=5900, Invalid=46312, Unknown=0, NotChecked=0, Total=52212 [2021-10-28 22:59:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8959 states. [2021-10-28 22:59:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8959 to 1881. [2021-10-28 22:59:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.247340425531915) internal successors, (2345), 1880 states have internal predecessors, (2345), 0 states have call successors, (0), 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-28 22:59:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2345 transitions. [2021-10-28 22:59:51,356 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2345 transitions. Word has length 244 [2021-10-28 22:59:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:51,357 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2345 transitions. [2021-10-28 22:59:51,357 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-28 22:59:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2345 transitions. [2021-10-28 22:59:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-28 22:59:51,364 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:51,364 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:51,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-28 22:59:51,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:51,578 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-28 22:59:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1707308140, now seen corresponding path program 1 times [2021-10-28 22:59:51,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:51,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422545704] [2021-10-28 22:59:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:51,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2021-10-28 22:59:51,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:51,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422545704] [2021-10-28 22:59:51,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422545704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:51,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:51,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:51,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255630772] [2021-10-28 22:59:51,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:51,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:51,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:51,742 INFO L87 Difference]: Start difference. First operand 1881 states and 2345 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-28 22:59:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:52,106 INFO L93 Difference]: Finished difference Result 3333 states and 4192 transitions. [2021-10-28 22:59:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 251 [2021-10-28 22:59:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:52,111 INFO L225 Difference]: With dead ends: 3333 [2021-10-28 22:59:52,111 INFO L226 Difference]: Without dead ends: 1881 [2021-10-28 22:59:52,115 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-10-28 22:59:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1881. [2021-10-28 22:59:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.2425531914893617) internal successors, (2336), 1880 states have internal predecessors, (2336), 0 states have call successors, (0), 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-28 22:59:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2336 transitions. [2021-10-28 22:59:52,475 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2336 transitions. Word has length 251 [2021-10-28 22:59:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:52,478 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2336 transitions. [2021-10-28 22:59:52,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-28 22:59:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2336 transitions. [2021-10-28 22:59:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-28 22:59:52,484 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:52,485 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:59:52,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-28 22:59:52,485 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-28 22:59:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1469760484, now seen corresponding path program 1 times [2021-10-28 22:59:52,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:52,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571173192] [2021-10-28 22:59:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:52,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 22:59:52,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:52,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571173192] [2021-10-28 22:59:52,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571173192] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:52,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596455692] [2021-10-28 22:59:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:52,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:59:52,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:52,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:59:52,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-28 22:59:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:53,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-28 22:59:53,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:59:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-28 22:59:55,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596455692] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:59:55,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:59:55,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2021-10-28 22:59:55,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566476739] [2021-10-28 22:59:55,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-28 22:59:55,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-28 22:59:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2021-10-28 22:59:55,025 INFO L87 Difference]: Start difference. First operand 1881 states and 2336 transitions. Second operand has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 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-28 23:00:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:04,836 INFO L93 Difference]: Finished difference Result 11574 states and 14748 transitions. [2021-10-28 23:00:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-10-28 23:00:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 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) Word has length 251 [2021-10-28 23:00:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:04,859 INFO L225 Difference]: With dead ends: 11574 [2021-10-28 23:00:04,859 INFO L226 Difference]: Without dead ends: 10261 [2021-10-28 23:00:04,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10074 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2832, Invalid=28320, Unknown=0, NotChecked=0, Total=31152 [2021-10-28 23:00:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2021-10-28 23:00:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 1881. [2021-10-28 23:00:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.2404255319148936) internal successors, (2332), 1880 states have internal predecessors, (2332), 0 states have call successors, (0), 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-28 23:00:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2332 transitions. [2021-10-28 23:00:05,215 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2332 transitions. Word has length 251 [2021-10-28 23:00:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:05,216 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2332 transitions. [2021-10-28 23:00:05,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 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-28 23:00:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2332 transitions. [2021-10-28 23:00:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:00:05,222 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:05,223 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:00:05,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-28 23:00:05,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:00:05,438 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-28 23:00:05,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 332354457, now seen corresponding path program 1 times [2021-10-28 23:00:05,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:05,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322867110] [2021-10-28 23:00:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:05,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:05,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:05,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322867110] [2021-10-28 23:00:05,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322867110] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:05,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707451266] [2021-10-28 23:00:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:05,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:00:05,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:00:05,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:00:05,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-28 23:00:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 23:00:06,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:00:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:07,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707451266] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:07,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:00:07,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-28 23:00:07,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267461846] [2021-10-28 23:00:07,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:00:07,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:00:07,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:00:07,231 INFO L87 Difference]: Start difference. First operand 1881 states and 2332 transitions. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 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-28 23:00:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:08,778 INFO L93 Difference]: Finished difference Result 7328 states and 9256 transitions. [2021-10-28 23:00:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-28 23:00:08,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 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 268 [2021-10-28 23:00:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:08,791 INFO L225 Difference]: With dead ends: 7328 [2021-10-28 23:00:08,791 INFO L226 Difference]: Without dead ends: 6238 [2021-10-28 23:00:08,794 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2021-10-28 23:00:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6238 states. [2021-10-28 23:00:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6238 to 3369. [2021-10-28 23:00:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.2419833729216152) internal successors, (4183), 3368 states have internal predecessors, (4183), 0 states have call successors, (0), 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-28 23:00:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4183 transitions. [2021-10-28 23:00:09,443 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4183 transitions. Word has length 268 [2021-10-28 23:00:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:09,444 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4183 transitions. [2021-10-28 23:00:09,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 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-28 23:00:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4183 transitions. [2021-10-28 23:00:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:00:09,454 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:09,454 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:00:09,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-28 23:00:09,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-10-28 23:00:09,682 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-28 23:00:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash 156390021, now seen corresponding path program 1 times [2021-10-28 23:00:09,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:09,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511017352] [2021-10-28 23:00:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:09,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:09,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:09,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511017352] [2021-10-28 23:00:09,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511017352] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:09,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583668991] [2021-10-28 23:00:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:09,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:00:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:00:09,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:00:09,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-28 23:00:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:10,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 23:00:10,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:00:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:11,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583668991] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:11,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:00:11,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-28 23:00:11,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514692594] [2021-10-28 23:00:11,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:00:11,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:00:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:00:11,660 INFO L87 Difference]: Start difference. First operand 3369 states and 4183 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 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-28 23:00:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:14,091 INFO L93 Difference]: Finished difference Result 14731 states and 18528 transitions. [2021-10-28 23:00:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-28 23:00:14,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 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 268 [2021-10-28 23:00:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:14,105 INFO L225 Difference]: With dead ends: 14731 [2021-10-28 23:00:14,105 INFO L226 Difference]: Without dead ends: 12520 [2021-10-28 23:00:14,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-10-28 23:00:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12520 states. [2021-10-28 23:00:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12520 to 4983. [2021-10-28 23:00:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4982 states have (on average 1.2193898032918506) internal successors, (6075), 4982 states have internal predecessors, (6075), 0 states have call successors, (0), 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-28 23:00:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6075 transitions. [2021-10-28 23:00:15,297 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6075 transitions. Word has length 268 [2021-10-28 23:00:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:15,298 INFO L470 AbstractCegarLoop]: Abstraction has 4983 states and 6075 transitions. [2021-10-28 23:00:15,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 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-28 23:00:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6075 transitions. [2021-10-28 23:00:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:00:15,309 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:15,310 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:00:15,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-28 23:00:15,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-10-28 23:00:15,531 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-28 23:00:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1506202107, now seen corresponding path program 1 times [2021-10-28 23:00:15,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:15,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592213626] [2021-10-28 23:00:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:15,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:16,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:16,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592213626] [2021-10-28 23:00:16,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592213626] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:16,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119843719] [2021-10-28 23:00:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:16,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:00:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:00:16,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:00:16,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-28 23:00:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:16,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-10-28 23:00:16,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:00:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:18,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119843719] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:18,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:00:18,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-28 23:00:18,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111410455] [2021-10-28 23:00:18,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-28 23:00:18,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-28 23:00:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-28 23:00:18,439 INFO L87 Difference]: Start difference. First operand 4983 states and 6075 transitions. Second operand has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 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-28 23:00:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:52,511 INFO L93 Difference]: Finished difference Result 53838 states and 68015 transitions. [2021-10-28 23:00:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-28 23:00:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 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 268 [2021-10-28 23:00:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:52,582 INFO L225 Difference]: With dead ends: 53838 [2021-10-28 23:00:52,583 INFO L226 Difference]: Without dead ends: 50191 [2021-10-28 23:00:52,614 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94096 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-28 23:00:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50191 states. [2021-10-28 23:00:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50191 to 7440. [2021-10-28 23:00:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.2486893399650492) internal successors, (9289), 7439 states have internal predecessors, (9289), 0 states have call successors, (0), 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-28 23:00:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 9289 transitions. [2021-10-28 23:00:54,087 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 9289 transitions. Word has length 268 [2021-10-28 23:00:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:54,087 INFO L470 AbstractCegarLoop]: Abstraction has 7440 states and 9289 transitions. [2021-10-28 23:00:54,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 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-28 23:00:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 9289 transitions. [2021-10-28 23:00:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:00:54,102 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:54,102 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:00:54,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-10-28 23:00:54,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-10-28 23:00:54,303 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-28 23:00:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash -559164221, now seen corresponding path program 1 times [2021-10-28 23:00:54,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:54,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353678555] [2021-10-28 23:00:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:54,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-28 23:00:54,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:54,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353678555] [2021-10-28 23:00:54,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353678555] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:54,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:54,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:00:54,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706152152] [2021-10-28 23:00:54,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:00:54,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:00:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:54,479 INFO L87 Difference]: Start difference. First operand 7440 states and 9289 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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-28 23:00:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:55,631 INFO L93 Difference]: Finished difference Result 13663 states and 17103 transitions. [2021-10-28 23:00:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:00:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 268 [2021-10-28 23:00:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:55,640 INFO L225 Difference]: With dead ends: 13663 [2021-10-28 23:00:55,641 INFO L226 Difference]: Without dead ends: 7440 [2021-10-28 23:00:55,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:00:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2021-10-28 23:00:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2021-10-28 23:00:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.2450598198682619) internal successors, (9262), 7439 states have internal predecessors, (9262), 0 states have call successors, (0), 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-28 23:00:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 9262 transitions. [2021-10-28 23:00:57,090 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 9262 transitions. Word has length 268 [2021-10-28 23:00:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:57,091 INFO L470 AbstractCegarLoop]: Abstraction has 7440 states and 9262 transitions. [2021-10-28 23:00:57,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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-28 23:00:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 9262 transitions. [2021-10-28 23:00:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:00:57,103 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:57,103 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:00:57,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-28 23:00:57,104 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-28 23:00:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1955661567, now seen corresponding path program 1 times [2021-10-28 23:00:57,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:57,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998972123] [2021-10-28 23:00:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:57,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:57,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:57,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998972123] [2021-10-28 23:00:57,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998972123] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:57,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997318962] [2021-10-28 23:00:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:57,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:00:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:00:57,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:00:57,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-28 23:00:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-28 23:00:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:00:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:00:59,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997318962] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:00:59,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:00:59,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-28 23:00:59,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631000934] [2021-10-28 23:00:59,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-28 23:00:59,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-28 23:00:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-10-28 23:00:59,961 INFO L87 Difference]: Start difference. First operand 7440 states and 9262 transitions. Second operand has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 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-28 23:01:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:44,610 INFO L93 Difference]: Finished difference Result 115635 states and 148560 transitions. [2021-10-28 23:01:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2021-10-28 23:01:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 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 268 [2021-10-28 23:01:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:44,799 INFO L225 Difference]: With dead ends: 115635 [2021-10-28 23:01:44,800 INFO L226 Difference]: Without dead ends: 110341 [2021-10-28 23:01:44,837 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76900 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15860, Invalid=169470, Unknown=0, NotChecked=0, Total=185330 [2021-10-28 23:01:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110341 states. [2021-10-28 23:01:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110341 to 10475. [2021-10-28 23:01:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 1.2468016039717396) internal successors, (13059), 10474 states have internal predecessors, (13059), 0 states have call successors, (0), 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-28 23:01:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 13059 transitions. [2021-10-28 23:01:47,782 INFO L78 Accepts]: Start accepts. Automaton has 10475 states and 13059 transitions. Word has length 268 [2021-10-28 23:01:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:47,783 INFO L470 AbstractCegarLoop]: Abstraction has 10475 states and 13059 transitions. [2021-10-28 23:01:47,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 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-28 23:01:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 10475 states and 13059 transitions. [2021-10-28 23:01:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-28 23:01:47,803 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:47,804 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:01:47,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-28 23:01:48,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-10-28 23:01:48,018 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-28 23:01:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1410788993, now seen corresponding path program 1 times [2021-10-28 23:01:48,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:48,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988674935] [2021-10-28 23:01:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:48,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-10-28 23:01:48,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:48,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988674935] [2021-10-28 23:01:48,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988674935] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:48,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:48,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:01:48,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722601974] [2021-10-28 23:01:48,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:01:48,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:01:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:01:48,123 INFO L87 Difference]: Start difference. First operand 10475 states and 13059 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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-28 23:01:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:50,438 INFO L93 Difference]: Finished difference Result 19622 states and 24627 transitions. [2021-10-28 23:01:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:01:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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 268 [2021-10-28 23:01:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:50,453 INFO L225 Difference]: With dead ends: 19622 [2021-10-28 23:01:50,454 INFO L226 Difference]: Without dead ends: 10162 [2021-10-28 23:01:50,463 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:01:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2021-10-28 23:01:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 10162. [2021-10-28 23:01:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10161 states have (on average 1.2483023324475937) internal successors, (12684), 10161 states have internal predecessors, (12684), 0 states have call successors, (0), 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-28 23:01:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 12684 transitions. [2021-10-28 23:01:52,673 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 12684 transitions. Word has length 268 [2021-10-28 23:01:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:52,674 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 12684 transitions. [2021-10-28 23:01:52,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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-28 23:01:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 12684 transitions. [2021-10-28 23:01:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-28 23:01:52,693 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:52,693 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:01:52,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-28 23:01:52,693 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-28 23:01:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 632679647, now seen corresponding path program 1 times [2021-10-28 23:01:52,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:52,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469592721] [2021-10-28 23:01:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:52,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:01:53,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:53,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469592721] [2021-10-28 23:01:53,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469592721] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:01:53,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285915279] [2021-10-28 23:01:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:53,150 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:01:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:01:53,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:01:53,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-28 23:01:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:54,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-28 23:01:54,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:01:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:01:55,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285915279] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:01:55,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:01:55,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-28 23:01:55,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767505180] [2021-10-28 23:01:55,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-28 23:01:55,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-28 23:01:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-28 23:01:55,982 INFO L87 Difference]: Start difference. First operand 10162 states and 12684 transitions. Second operand has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 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-28 23:03:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:03:01,852 INFO L93 Difference]: Finished difference Result 130069 states and 167788 transitions. [2021-10-28 23:03:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-28 23:03:01,853 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 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 269 [2021-10-28 23:03:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:03:02,028 INFO L225 Difference]: With dead ends: 130069 [2021-10-28 23:03:02,028 INFO L226 Difference]: Without dead ends: 121112 [2021-10-28 23:03:02,251 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92538 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-28 23:03:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121112 states. [2021-10-28 23:03:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121112 to 10240. [2021-10-28 23:03:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 1.2502197480222679) internal successors, (12801), 10239 states have internal predecessors, (12801), 0 states have call successors, (0), 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-28 23:03:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 12801 transitions. [2021-10-28 23:03:05,114 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 12801 transitions. Word has length 269 [2021-10-28 23:03:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:03:05,115 INFO L470 AbstractCegarLoop]: Abstraction has 10240 states and 12801 transitions. [2021-10-28 23:03:05,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 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-28 23:03:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 12801 transitions. [2021-10-28 23:03:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-28 23:03:05,128 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:03:05,128 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:03:05,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-28 23:03:05,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:03:05,338 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-28 23:03:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:03:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1579717533, now seen corresponding path program 1 times [2021-10-28 23:03:05,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:03:05,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133057901] [2021-10-28 23:03:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:05,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:03:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:03:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-28 23:03:05,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:03:05,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133057901] [2021-10-28 23:03:05,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133057901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:03:05,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:03:05,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:03:05,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714279953] [2021-10-28 23:03:05,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:03:05,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:03:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:03:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:03:05,469 INFO L87 Difference]: Start difference. First operand 10240 states and 12801 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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-28 23:03:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:03:07,760 INFO L93 Difference]: Finished difference Result 19704 states and 24735 transitions. [2021-10-28 23:03:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:03:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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 269 [2021-10-28 23:03:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:03:07,769 INFO L225 Difference]: With dead ends: 19704 [2021-10-28 23:03:07,769 INFO L226 Difference]: Without dead ends: 10279 [2021-10-28 23:03:07,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:03:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2021-10-28 23:03:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 10162. [2021-10-28 23:03:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10161 states have (on average 1.2483023324475937) internal successors, (12684), 10161 states have internal predecessors, (12684), 0 states have call successors, (0), 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-28 23:03:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 12684 transitions. [2021-10-28 23:03:09,814 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 12684 transitions. Word has length 269 [2021-10-28 23:03:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:03:09,814 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 12684 transitions. [2021-10-28 23:03:09,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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-28 23:03:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 12684 transitions. [2021-10-28 23:03:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-28 23:03:09,823 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:03:09,823 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:03:09,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-28 23:03:09,824 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-28 23:03:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:03:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 203021341, now seen corresponding path program 1 times [2021-10-28 23:03:09,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:03:09,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083414255] [2021-10-28 23:03:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:09,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:03:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:03:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-28 23:03:09,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:03:09,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083414255] [2021-10-28 23:03:09,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083414255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:03:09,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:03:09,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:03:09,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89830353] [2021-10-28 23:03:09,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:03:09,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:03:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:03:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:03:09,908 INFO L87 Difference]: Start difference. First operand 10162 states and 12684 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-28 23:03:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:03:11,624 INFO L93 Difference]: Finished difference Result 16459 states and 20685 transitions. [2021-10-28 23:03:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:03:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 269 [2021-10-28 23:03:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:03:11,630 INFO L225 Difference]: With dead ends: 16459 [2021-10-28 23:03:11,630 INFO L226 Difference]: Without dead ends: 7070 [2021-10-28 23:03:11,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:03:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2021-10-28 23:03:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 7070. [2021-10-28 23:03:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 7069 states have (on average 1.2485500070731361) internal successors, (8826), 7069 states have internal predecessors, (8826), 0 states have call successors, (0), 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-28 23:03:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 8826 transitions. [2021-10-28 23:03:13,173 INFO L78 Accepts]: Start accepts. Automaton has 7070 states and 8826 transitions. Word has length 269 [2021-10-28 23:03:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:03:13,173 INFO L470 AbstractCegarLoop]: Abstraction has 7070 states and 8826 transitions. [2021-10-28 23:03:13,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-28 23:03:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7070 states and 8826 transitions. [2021-10-28 23:03:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2021-10-28 23:03:13,182 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:03:13,183 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:03:13,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-28 23:03:13,183 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-28 23:03:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:03:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1098291723, now seen corresponding path program 1 times [2021-10-28 23:03:13,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:03:13,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087253588] [2021-10-28 23:03:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:13,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:03:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:03:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-28 23:03:13,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:03:13,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087253588] [2021-10-28 23:03:13,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087253588] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:03:13,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619469960] [2021-10-28 23:03:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:13,412 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:03:13,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:03:13,413 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:03:13,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-28 23:03:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:03:14,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-28 23:03:14,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:03:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-10-28 23:03:15,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619469960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:03:15,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:03:15,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2021-10-28 23:03:15,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056528582] [2021-10-28 23:03:15,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:03:15,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:03:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:03:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2021-10-28 23:03:15,090 INFO L87 Difference]: Start difference. First operand 7070 states and 8826 transitions. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 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-28 23:03:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:03:21,499 INFO L93 Difference]: Finished difference Result 24601 states and 31427 transitions. [2021-10-28 23:03:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-28 23:03:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 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 270 [2021-10-28 23:03:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:03:21,518 INFO L225 Difference]: With dead ends: 24601 [2021-10-28 23:03:21,518 INFO L226 Difference]: Without dead ends: 18538 [2021-10-28 23:03:21,522 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2021-10-28 23:03:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18538 states. [2021-10-28 23:03:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18538 to 6722. [2021-10-28 23:03:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6722 states, 6721 states have (on average 1.25591429846749) internal successors, (8441), 6721 states have internal predecessors, (8441), 0 states have call successors, (0), 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-28 23:03:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6722 states to 6722 states and 8441 transitions. [2021-10-28 23:03:23,278 INFO L78 Accepts]: Start accepts. Automaton has 6722 states and 8441 transitions. Word has length 270 [2021-10-28 23:03:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:03:23,279 INFO L470 AbstractCegarLoop]: Abstraction has 6722 states and 8441 transitions. [2021-10-28 23:03:23,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 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-28 23:03:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6722 states and 8441 transitions. [2021-10-28 23:03:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-28 23:03:23,286 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:03:23,286 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:03:23,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-10-28 23:03:23,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:03:23,487 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-28 23:03:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:03:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 109258159, now seen corresponding path program 1 times [2021-10-28 23:03:23,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:03:23,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212544515] [2021-10-28 23:03:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:23,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:03:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:03:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-10-28 23:03:23,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:03:23,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212544515] [2021-10-28 23:03:23,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212544515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:03:23,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:03:23,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:03:23,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979972447] [2021-10-28 23:03:23,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:03:23,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:03:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:03:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:03:23,593 INFO L87 Difference]: Start difference. First operand 6722 states and 8441 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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-28 23:03:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:03:27,319 INFO L93 Difference]: Finished difference Result 17080 states and 21613 transitions. [2021-10-28 23:03:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:03:27,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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-28 23:03:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:03:27,330 INFO L225 Difference]: With dead ends: 17080 [2021-10-28 23:03:27,330 INFO L226 Difference]: Without dead ends: 11017 [2021-10-28 23:03:27,334 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:03:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2021-10-28 23:03:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 6682. [2021-10-28 23:03:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6682 states, 6681 states have (on average 1.2544529262086515) internal successors, (8381), 6681 states have internal predecessors, (8381), 0 states have call successors, (0), 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-28 23:03:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 8381 transitions. [2021-10-28 23:03:29,059 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 8381 transitions. Word has length 271 [2021-10-28 23:03:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:03:29,059 INFO L470 AbstractCegarLoop]: Abstraction has 6682 states and 8381 transitions. [2021-10-28 23:03:29,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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-28 23:03:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 8381 transitions. [2021-10-28 23:03:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-10-28 23:03:29,064 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:03:29,065 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:03:29,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-28 23:03:29,065 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-28 23:03:29,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:03:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1649321138, now seen corresponding path program 1 times [2021-10-28 23:03:29,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:03:29,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705216257] [2021-10-28 23:03:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:03:29,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:03:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:03:29,152 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:03:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:03:29,408 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:03:29,409 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:03:29,410 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,413 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,414 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:03:29,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-28 23:03:29,427 INFO L731 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:03:29,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:03:29,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:03:29 BoogieIcfgContainer [2021-10-28 23:03:29,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:03:29,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:03:29,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:03:29,763 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:03:29,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:04" (3/4) ... [2021-10-28 23:03:29,766 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:03:30,153 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:03:30,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:03:30,155 INFO L168 Benchmark]: Toolchain (without parser) took 268036.48 ms. Allocated memory was 79.7 MB in the beginning and 6.3 GB in the end (delta: 6.2 GB). Free memory was 45.4 MB in the beginning and 4.9 GB in the end (delta: -4.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,156 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 79.7 MB. Free memory was 52.2 MB in the beginning and 52.2 MB in the end (delta: 30.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:03:30,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.03 ms. Allocated memory was 79.7 MB in the beginning and 107.0 MB in the end (delta: 27.3 MB). Free memory was 45.3 MB in the beginning and 78.0 MB in the end (delta: -32.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.06 ms. Allocated memory is still 107.0 MB. Free memory was 78.0 MB in the beginning and 71.9 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,157 INFO L168 Benchmark]: Boogie Preprocessor took 142.22 ms. Allocated memory is still 107.0 MB. Free memory was 71.9 MB in the beginning and 66.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,157 INFO L168 Benchmark]: RCFGBuilder took 1625.23 ms. Allocated memory is still 107.0 MB. Free memory was 66.7 MB in the beginning and 51.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,158 INFO L168 Benchmark]: TraceAbstraction took 265270.66 ms. Allocated memory was 107.0 MB in the beginning and 6.3 GB in the end (delta: 6.2 GB). Free memory was 50.8 MB in the beginning and 5.0 GB in the end (delta: -4.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,158 INFO L168 Benchmark]: Witness Printer took 390.30 ms. Allocated memory is still 6.3 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 68.2 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:03:30,160 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.24 ms. Allocated memory is still 79.7 MB. Free memory was 52.2 MB in the beginning and 52.2 MB in the end (delta: 30.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 461.03 ms. Allocated memory was 79.7 MB in the beginning and 107.0 MB in the end (delta: 27.3 MB). Free memory was 45.3 MB in the beginning and 78.0 MB in the end (delta: -32.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 129.06 ms. Allocated memory is still 107.0 MB. Free memory was 78.0 MB in the beginning and 71.9 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 142.22 ms. Allocated memory is still 107.0 MB. Free memory was 71.9 MB in the beginning and 66.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1625.23 ms. Allocated memory is still 107.0 MB. Free memory was 66.7 MB in the beginning and 51.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 265270.66 ms. Allocated memory was 107.0 MB in the beginning and 6.3 GB in the end (delta: 6.2 GB). Free memory was 50.8 MB in the beginning and 5.0 GB in the end (delta: -4.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. * Witness Printer took 390.30 ms. Allocated memory is still 6.3 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 68.2 MB). Peak memory consumption was 67.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 535]: 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 ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] 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] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L98] 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] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L98] 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] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L98] 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] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L98] 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] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] 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] [L499] i2 = init() [L500] COND FALSE !(!(i2)) 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] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] 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] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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] [L345] 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] [L346] 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] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] 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] [L376] 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] [L377] 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] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] 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] [L186] 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] 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] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] 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] [L413] COND TRUE (int )next_state == 0 [L414] 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] [L424] COND FALSE !(!((_Bool )tmp___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=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] [L425] 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] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] 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] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] 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] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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] [L249] 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] [L252] 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] [L255] COND TRUE ! gate3Failed [L256] 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] [L260] COND FALSE !(!((_Bool )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=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] [L126] 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] [L127] 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] [L130] COND TRUE historyIndex == 1 [L131] 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] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 [L126] 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] [L136] 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] [L137] 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] [L140] COND TRUE historyIndex == 1 [L141] 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] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 [L126] 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] [L136] 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] [L146] 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] [L147] 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] [L150] COND TRUE historyIndex == 1 [L151] 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] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] 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] [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] 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] [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] 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] [L280] 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] [L294] 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] [L106] 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] [L107] 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] [L110] COND TRUE historyIndex == 1 [L111] 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] [L300] tmp___10 = read_history_int8(3, 1) [L301] 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] [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L320] tmp___11 = read_history_int8(3, 0) [L321] 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] [L333] 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] [L520] c1 = check() [L533] 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] [L522] i2 ++ 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] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] 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] [L351] COND TRUE (int )next_state == 0 [L352] 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] [L362] COND FALSE !(!((_Bool )tmp___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=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] [L363] 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] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] 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] [L376] 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] [L377] 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] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] 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] [L186] 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] 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] [L407] 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] [L408] 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] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] 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] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] 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] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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] [L249] COND TRUE ! gate1Failed [L250] 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] [L260] COND FALSE !(!((_Bool )tmp)) 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] [L126] 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] [L127] 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] [L130] COND TRUE historyIndex == 1 [L131] 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] [L261] tmp___3 = read_history_bool(0, 1) [L262] 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] [L106] 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] [L107] 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] [L110] COND TRUE historyIndex == 1 [L111] 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] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg [L126] 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] [L127] 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] [L130] COND TRUE historyIndex == 1 [L131] 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] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) [L126] 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] [L136] 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] [L137] 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] [L140] COND TRUE historyIndex == 1 [L141] 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] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) [L126] 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] [L136] 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] [L146] 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] [L147] 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] [L150] COND TRUE historyIndex == 1 [L151] 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] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] 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] [L520] c1 = check() [L533] 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] [L535] 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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: 535]: 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, 518 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 264.8s, OverallIterations: 56, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 208.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 29969 SDtfs, 49627 SDslu, 198453 SDs, 0 SdLazy, 67816 SolverSat, 1454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5185 GetRequests, 2939 SyntacticMatches, 4 SemanticMatches, 2242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303424 ImplicationChecksByTransitivity, 75.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10475occurred in iteration=49, InterpolantAutomatonStates: 2119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.1s AutomataMinimizationTime, 55 MinimizatonAttempts, 312019 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 12164 NumberOfCodeBlocks, 12164 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11821 ConstructedInterpolants, 0 QuantifiedInterpolants, 37104 SizeOfPredicates, 88 NumberOfNonLiveVariables, 12201 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 68 InterpolantComputations, 44 PerfectInterpolantSequences, 6662/7322 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-28 23:03:30,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38d6de4-e512-48f1-bdaf-78596cd6679b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...