./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer --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 b6f3ff50a8225ec4a3561cddab24b29423f49c6e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-a4ecdab [2020-11-30 00:35:11,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:35:11,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:35:11,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:35:11,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:35:11,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:35:11,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:35:11,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:35:11,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:35:11,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:35:11,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:35:11,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:35:11,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:35:11,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:35:11,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:35:11,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:35:11,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:35:11,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:35:11,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:35:11,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:35:11,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:35:11,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:35:11,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:35:11,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:35:11,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:35:11,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:35:11,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:35:11,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:35:11,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:35:11,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:35:11,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:35:11,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:35:11,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:35:11,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:35:11,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:35:11,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:35:11,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:35:11,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:35:11,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:35:11,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:35:11,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:35:11,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:35:11,403 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:35:11,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:35:11,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:35:11,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:35:11,406 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:35:11,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:35:11,406 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:35:11,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:35:11,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:35:11,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:35:11,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:35:11,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:35:11,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:35:11,409 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:35:11,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:35:11,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:35:11,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:35:11,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:35:11,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:35:11,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:35:11,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:35:11,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:35:11,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:35:11,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:35:11,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:35:11,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:35:11,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:35:11,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:35:11,412 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:35:11,412 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-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/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-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer 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 -> b6f3ff50a8225ec4a3561cddab24b29423f49c6e [2020-11-30 00:35:11,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:35:11,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:35:11,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:35:11,725 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:35:11,726 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:35:11,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2020-11-30 00:35:11,809 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/data/d5bae3687/1f4aa8c978ab4d2db6a95bda26a64005/FLAGd5f0b23b1 [2020-11-30 00:35:12,285 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:35:12,286 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2020-11-30 00:35:12,295 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/data/d5bae3687/1f4aa8c978ab4d2db6a95bda26a64005/FLAGd5f0b23b1 [2020-11-30 00:35:12,620 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/data/d5bae3687/1f4aa8c978ab4d2db6a95bda26a64005 [2020-11-30 00:35:12,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:35:12,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:35:12,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:35:12,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:35:12,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:35:12,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:35:12" (1/1) ... [2020-11-30 00:35:12,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ea5f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:12, skipping insertion in model container [2020-11-30 00:35:12,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:35:12" (1/1) ... [2020-11-30 00:35:12,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:35:12,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:35:12,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:35:12,939 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:35:13,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:35:13,030 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:35:13,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13 WrapperNode [2020-11-30 00:35:13,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:35:13,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:35:13,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:35:13,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:35:13,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:35:13,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:35:13,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:35:13,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:35:13,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... [2020-11-30 00:35:13,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:35:13,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:35:13,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:35:13,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:35:13,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:35:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:35:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:35:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:35:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:35:15,431 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:35:15,432 INFO L298 CfgBuilder]: Removed 257 assume(true) statements. [2020-11-30 00:35:15,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:15 BoogieIcfgContainer [2020-11-30 00:35:15,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:35:15,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:35:15,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:35:15,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:35:15,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:35:12" (1/3) ... [2020-11-30 00:35:15,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6e3356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:35:15, skipping insertion in model container [2020-11-30 00:35:15,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:35:13" (2/3) ... [2020-11-30 00:35:15,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6e3356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:35:15, skipping insertion in model container [2020-11-30 00:35:15,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:15" (3/3) ... [2020-11-30 00:35:15,450 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2020-11-30 00:35:15,459 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:35:15,464 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2020-11-30 00:35:15,474 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2020-11-30 00:35:15,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:35:15,506 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:35:15,506 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:35:15,506 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:35:15,506 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:35:15,507 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:35:15,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:35:15,507 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:35:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states. [2020-11-30 00:35:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:35:15,557 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:15,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:15,559 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2020-11-30 00:35:15,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:15,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980608775] [2020-11-30 00:35:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:15,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980608775] [2020-11-30 00:35:15,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:15,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:15,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324575532] [2020-11-30 00:35:15,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:15,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:15,810 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 3 states. [2020-11-30 00:35:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:16,155 INFO L93 Difference]: Finished difference Result 1282 states and 2097 transitions. [2020-11-30 00:35:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:16,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:35:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:16,189 INFO L225 Difference]: With dead ends: 1282 [2020-11-30 00:35:16,192 INFO L226 Difference]: Without dead ends: 726 [2020-11-30 00:35:16,206 INFO L677 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 [2020-11-30 00:35:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2020-11-30 00:35:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 457. [2020-11-30 00:35:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-11-30 00:35:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 712 transitions. [2020-11-30 00:35:16,319 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 712 transitions. Word has length 9 [2020-11-30 00:35:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:16,319 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 712 transitions. [2020-11-30 00:35:16,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 712 transitions. [2020-11-30 00:35:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:35:16,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:16,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:16,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:35:16,322 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1330220136, now seen corresponding path program 1 times [2020-11-30 00:35:16,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:16,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204996274] [2020-11-30 00:35:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:16,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204996274] [2020-11-30 00:35:16,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:16,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:16,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142142310] [2020-11-30 00:35:16,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:16,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:16,390 INFO L87 Difference]: Start difference. First operand 457 states and 712 transitions. Second operand 3 states. [2020-11-30 00:35:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:16,512 INFO L93 Difference]: Finished difference Result 1131 states and 1746 transitions. [2020-11-30 00:35:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:16,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 00:35:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:16,520 INFO L225 Difference]: With dead ends: 1131 [2020-11-30 00:35:16,520 INFO L226 Difference]: Without dead ends: 676 [2020-11-30 00:35:16,522 INFO L677 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 [2020-11-30 00:35:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2020-11-30 00:35:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 424. [2020-11-30 00:35:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-30 00:35:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 654 transitions. [2020-11-30 00:35:16,551 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 654 transitions. Word has length 10 [2020-11-30 00:35:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:16,551 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 654 transitions. [2020-11-30 00:35:16,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 654 transitions. [2020-11-30 00:35:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:35:16,553 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:16,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:16,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:35:16,554 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1243418079, now seen corresponding path program 1 times [2020-11-30 00:35:16,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:16,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075535812] [2020-11-30 00:35:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:16,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075535812] [2020-11-30 00:35:16,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:16,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:16,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521267907] [2020-11-30 00:35:16,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:16,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:16,616 INFO L87 Difference]: Start difference. First operand 424 states and 654 transitions. Second operand 3 states. [2020-11-30 00:35:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:16,698 INFO L93 Difference]: Finished difference Result 1250 states and 1933 transitions. [2020-11-30 00:35:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:16,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-30 00:35:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:16,704 INFO L225 Difference]: With dead ends: 1250 [2020-11-30 00:35:16,704 INFO L226 Difference]: Without dead ends: 836 [2020-11-30 00:35:16,706 INFO L677 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 [2020-11-30 00:35:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-11-30 00:35:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 428. [2020-11-30 00:35:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-11-30 00:35:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 658 transitions. [2020-11-30 00:35:16,725 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 658 transitions. Word has length 14 [2020-11-30 00:35:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:16,725 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 658 transitions. [2020-11-30 00:35:16,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 658 transitions. [2020-11-30 00:35:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:35:16,739 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:16,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:16,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:35:16,740 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1419090732, now seen corresponding path program 1 times [2020-11-30 00:35:16,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:16,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504985919] [2020-11-30 00:35:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:16,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504985919] [2020-11-30 00:35:16,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:16,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:16,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141350003] [2020-11-30 00:35:16,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:16,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:16,827 INFO L87 Difference]: Start difference. First operand 428 states and 658 transitions. Second operand 4 states. [2020-11-30 00:35:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:16,934 INFO L93 Difference]: Finished difference Result 1579 states and 2407 transitions. [2020-11-30 00:35:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:16,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 00:35:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:16,943 INFO L225 Difference]: With dead ends: 1579 [2020-11-30 00:35:16,943 INFO L226 Difference]: Without dead ends: 1165 [2020-11-30 00:35:16,944 INFO L677 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 [2020-11-30 00:35:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-11-30 00:35:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 430. [2020-11-30 00:35:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-11-30 00:35:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 660 transitions. [2020-11-30 00:35:16,966 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 660 transitions. Word has length 18 [2020-11-30 00:35:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:16,966 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 660 transitions. [2020-11-30 00:35:16,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 660 transitions. [2020-11-30 00:35:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:35:16,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:16,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:16,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:35:16,968 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 703965683, now seen corresponding path program 1 times [2020-11-30 00:35:16,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:16,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916187010] [2020-11-30 00:35:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:17,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916187010] [2020-11-30 00:35:17,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:17,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:17,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842879726] [2020-11-30 00:35:17,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:17,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:17,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:17,093 INFO L87 Difference]: Start difference. First operand 430 states and 660 transitions. Second operand 4 states. [2020-11-30 00:35:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:17,154 INFO L93 Difference]: Finished difference Result 673 states and 1026 transitions. [2020-11-30 00:35:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:17,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-30 00:35:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:17,158 INFO L225 Difference]: With dead ends: 673 [2020-11-30 00:35:17,158 INFO L226 Difference]: Without dead ends: 428 [2020-11-30 00:35:17,159 INFO L677 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 [2020-11-30 00:35:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-11-30 00:35:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2020-11-30 00:35:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-11-30 00:35:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 653 transitions. [2020-11-30 00:35:17,175 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 653 transitions. Word has length 19 [2020-11-30 00:35:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:17,176 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 653 transitions. [2020-11-30 00:35:17,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 653 transitions. [2020-11-30 00:35:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:35:17,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:17,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:17,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:35:17,178 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 628676147, now seen corresponding path program 1 times [2020-11-30 00:35:17,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:17,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187722391] [2020-11-30 00:35:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:17,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187722391] [2020-11-30 00:35:17,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541192119] [2020-11-30 00:35:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:17,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:35:17,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:35:17,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:17,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-30 00:35:17,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715563196] [2020-11-30 00:35:17,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:17,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:17,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:17,452 INFO L87 Difference]: Start difference. First operand 428 states and 653 transitions. Second operand 5 states. [2020-11-30 00:35:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:17,740 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2020-11-30 00:35:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:17,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-30 00:35:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:17,748 INFO L225 Difference]: With dead ends: 1667 [2020-11-30 00:35:17,749 INFO L226 Difference]: Without dead ends: 1250 [2020-11-30 00:35:17,750 INFO L677 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 [2020-11-30 00:35:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-11-30 00:35:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 574. [2020-11-30 00:35:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-11-30 00:35:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 903 transitions. [2020-11-30 00:35:17,801 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 903 transitions. Word has length 21 [2020-11-30 00:35:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:17,801 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 903 transitions. [2020-11-30 00:35:17,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:35:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 903 transitions. [2020-11-30 00:35:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:35:17,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:17,802 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:18,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-30 00:35:18,019 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -837838367, now seen corresponding path program 2 times [2020-11-30 00:35:18,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:18,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936783323] [2020-11-30 00:35:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:35:18,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936783323] [2020-11-30 00:35:18,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:18,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:18,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212725599] [2020-11-30 00:35:18,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:18,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:18,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:18,097 INFO L87 Difference]: Start difference. First operand 574 states and 903 transitions. Second operand 3 states. [2020-11-30 00:35:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:18,190 INFO L93 Difference]: Finished difference Result 1308 states and 2036 transitions. [2020-11-30 00:35:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:18,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 00:35:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:18,196 INFO L225 Difference]: With dead ends: 1308 [2020-11-30 00:35:18,196 INFO L226 Difference]: Without dead ends: 772 [2020-11-30 00:35:18,198 INFO L677 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 [2020-11-30 00:35:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-11-30 00:35:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 523. [2020-11-30 00:35:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-11-30 00:35:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 809 transitions. [2020-11-30 00:35:18,220 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 809 transitions. Word has length 28 [2020-11-30 00:35:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:18,220 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 809 transitions. [2020-11-30 00:35:18,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 809 transitions. [2020-11-30 00:35:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:35:18,221 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:18,221 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:18,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:35:18,222 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1453457771, now seen corresponding path program 1 times [2020-11-30 00:35:18,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:18,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141079285] [2020-11-30 00:35:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:35:18,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141079285] [2020-11-30 00:35:18,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:18,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:18,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894690519] [2020-11-30 00:35:18,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:18,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:18,308 INFO L87 Difference]: Start difference. First operand 523 states and 809 transitions. Second operand 3 states. [2020-11-30 00:35:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:18,456 INFO L93 Difference]: Finished difference Result 1188 states and 1818 transitions. [2020-11-30 00:35:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:18,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 00:35:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:18,461 INFO L225 Difference]: With dead ends: 1188 [2020-11-30 00:35:18,462 INFO L226 Difference]: Without dead ends: 694 [2020-11-30 00:35:18,463 INFO L677 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 [2020-11-30 00:35:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-11-30 00:35:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 457. [2020-11-30 00:35:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-11-30 00:35:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 684 transitions. [2020-11-30 00:35:18,490 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 684 transitions. Word has length 28 [2020-11-30 00:35:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:18,490 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 684 transitions. [2020-11-30 00:35:18,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 684 transitions. [2020-11-30 00:35:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:35:18,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:18,494 INFO L422 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] [2020-11-30 00:35:18,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:35:18,495 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1581264384, now seen corresponding path program 1 times [2020-11-30 00:35:18,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:18,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086110008] [2020-11-30 00:35:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:35:18,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086110008] [2020-11-30 00:35:18,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:18,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:18,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257814182] [2020-11-30 00:35:18,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:18,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:18,580 INFO L87 Difference]: Start difference. First operand 457 states and 684 transitions. Second operand 4 states. [2020-11-30 00:35:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:18,660 INFO L93 Difference]: Finished difference Result 1099 states and 1650 transitions. [2020-11-30 00:35:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:18,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-30 00:35:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:18,667 INFO L225 Difference]: With dead ends: 1099 [2020-11-30 00:35:18,667 INFO L226 Difference]: Without dead ends: 686 [2020-11-30 00:35:18,668 INFO L677 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 [2020-11-30 00:35:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-11-30 00:35:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 457. [2020-11-30 00:35:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-11-30 00:35:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 682 transitions. [2020-11-30 00:35:18,707 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 682 transitions. Word has length 38 [2020-11-30 00:35:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:18,708 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 682 transitions. [2020-11-30 00:35:18,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 682 transitions. [2020-11-30 00:35:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-30 00:35:18,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:18,711 INFO L422 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] [2020-11-30 00:35:18,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:35:18,712 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1902944388, now seen corresponding path program 1 times [2020-11-30 00:35:18,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:18,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160495919] [2020-11-30 00:35:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:35:18,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160495919] [2020-11-30 00:35:18,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:18,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:18,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92615664] [2020-11-30 00:35:18,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:18,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:18,805 INFO L87 Difference]: Start difference. First operand 457 states and 682 transitions. Second operand 3 states. [2020-11-30 00:35:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:18,881 INFO L93 Difference]: Finished difference Result 1035 states and 1549 transitions. [2020-11-30 00:35:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:18,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-30 00:35:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:18,887 INFO L225 Difference]: With dead ends: 1035 [2020-11-30 00:35:18,887 INFO L226 Difference]: Without dead ends: 641 [2020-11-30 00:35:18,891 INFO L677 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 [2020-11-30 00:35:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-11-30 00:35:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 413. [2020-11-30 00:35:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-11-30 00:35:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 608 transitions. [2020-11-30 00:35:18,910 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 608 transitions. Word has length 50 [2020-11-30 00:35:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:18,913 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 608 transitions. [2020-11-30 00:35:18,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2020-11-30 00:35:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-30 00:35:18,915 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:18,915 INFO L422 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] [2020-11-30 00:35:18,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:35:18,916 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1215657471, now seen corresponding path program 1 times [2020-11-30 00:35:18,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:18,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639633294] [2020-11-30 00:35:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:35:18,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639633294] [2020-11-30 00:35:18,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:18,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:18,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818073547] [2020-11-30 00:35:18,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:18,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:18,996 INFO L87 Difference]: Start difference. First operand 413 states and 608 transitions. Second operand 3 states. [2020-11-30 00:35:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,103 INFO L93 Difference]: Finished difference Result 869 states and 1278 transitions. [2020-11-30 00:35:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:19,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-30 00:35:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,108 INFO L225 Difference]: With dead ends: 869 [2020-11-30 00:35:19,109 INFO L226 Difference]: Without dead ends: 511 [2020-11-30 00:35:19,110 INFO L677 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 [2020-11-30 00:35:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-11-30 00:35:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2020-11-30 00:35:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-11-30 00:35:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 520 transitions. [2020-11-30 00:35:19,126 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 520 transitions. Word has length 51 [2020-11-30 00:35:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,127 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 520 transitions. [2020-11-30 00:35:19,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 520 transitions. [2020-11-30 00:35:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 00:35:19,128 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,129 INFO L422 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] [2020-11-30 00:35:19,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:35:19,129 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash -64177626, now seen corresponding path program 1 times [2020-11-30 00:35:19,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586342247] [2020-11-30 00:35:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:35:19,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586342247] [2020-11-30 00:35:19,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:19,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:19,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746863531] [2020-11-30 00:35:19,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:19,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:19,219 INFO L87 Difference]: Start difference. First operand 369 states and 520 transitions. Second operand 4 states. [2020-11-30 00:35:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,287 INFO L93 Difference]: Finished difference Result 877 states and 1257 transitions. [2020-11-30 00:35:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:19,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-30 00:35:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,293 INFO L225 Difference]: With dead ends: 877 [2020-11-30 00:35:19,294 INFO L226 Difference]: Without dead ends: 580 [2020-11-30 00:35:19,295 INFO L677 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 [2020-11-30 00:35:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-11-30 00:35:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 369. [2020-11-30 00:35:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-11-30 00:35:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 518 transitions. [2020-11-30 00:35:19,312 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 518 transitions. Word has length 62 [2020-11-30 00:35:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,313 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 518 transitions. [2020-11-30 00:35:19,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 518 transitions. [2020-11-30 00:35:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-30 00:35:19,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,314 INFO L422 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] [2020-11-30 00:35:19,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:35:19,315 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash 461299335, now seen corresponding path program 1 times [2020-11-30 00:35:19,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669267067] [2020-11-30 00:35:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-30 00:35:19,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669267067] [2020-11-30 00:35:19,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:19,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:19,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056740813] [2020-11-30 00:35:19,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:19,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:19,386 INFO L87 Difference]: Start difference. First operand 369 states and 518 transitions. Second operand 3 states. [2020-11-30 00:35:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,467 INFO L93 Difference]: Finished difference Result 728 states and 1056 transitions. [2020-11-30 00:35:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:19,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-11-30 00:35:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,472 INFO L225 Difference]: With dead ends: 728 [2020-11-30 00:35:19,472 INFO L226 Difference]: Without dead ends: 465 [2020-11-30 00:35:19,473 INFO L677 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 [2020-11-30 00:35:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-11-30 00:35:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 327. [2020-11-30 00:35:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-11-30 00:35:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 464 transitions. [2020-11-30 00:35:19,488 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 464 transitions. Word has length 76 [2020-11-30 00:35:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,489 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 464 transitions. [2020-11-30 00:35:19,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 464 transitions. [2020-11-30 00:35:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 00:35:19,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,490 INFO L422 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] [2020-11-30 00:35:19,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:35:19,491 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2065915736, now seen corresponding path program 1 times [2020-11-30 00:35:19,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811294352] [2020-11-30 00:35:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-30 00:35:19,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811294352] [2020-11-30 00:35:19,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:19,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:19,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954178557] [2020-11-30 00:35:19,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:19,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:19,571 INFO L87 Difference]: Start difference. First operand 327 states and 464 transitions. Second operand 3 states. [2020-11-30 00:35:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,615 INFO L93 Difference]: Finished difference Result 503 states and 726 transitions. [2020-11-30 00:35:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:19,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-11-30 00:35:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,618 INFO L225 Difference]: With dead ends: 503 [2020-11-30 00:35:19,618 INFO L226 Difference]: Without dead ends: 273 [2020-11-30 00:35:19,619 INFO L677 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 [2020-11-30 00:35:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-30 00:35:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2020-11-30 00:35:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-30 00:35:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 383 transitions. [2020-11-30 00:35:19,632 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 383 transitions. Word has length 85 [2020-11-30 00:35:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,632 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 383 transitions. [2020-11-30 00:35:19,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 383 transitions. [2020-11-30 00:35:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 00:35:19,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,640 INFO L422 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] [2020-11-30 00:35:19,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:35:19,640 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1342706796, now seen corresponding path program 1 times [2020-11-30 00:35:19,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534400363] [2020-11-30 00:35:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-30 00:35:19,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534400363] [2020-11-30 00:35:19,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:19,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:19,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190056447] [2020-11-30 00:35:19,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:19,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:19,722 INFO L87 Difference]: Start difference. First operand 273 states and 383 transitions. Second operand 4 states. [2020-11-30 00:35:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,769 INFO L93 Difference]: Finished difference Result 448 states and 644 transitions. [2020-11-30 00:35:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:19,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 00:35:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,772 INFO L225 Difference]: With dead ends: 448 [2020-11-30 00:35:19,773 INFO L226 Difference]: Without dead ends: 273 [2020-11-30 00:35:19,775 INFO L677 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 [2020-11-30 00:35:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-30 00:35:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2020-11-30 00:35:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-30 00:35:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 381 transitions. [2020-11-30 00:35:19,787 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 381 transitions. Word has length 88 [2020-11-30 00:35:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,788 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 381 transitions. [2020-11-30 00:35:19,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 381 transitions. [2020-11-30 00:35:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-30 00:35:19,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,789 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:19,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:35:19,790 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash -473857541, now seen corresponding path program 1 times [2020-11-30 00:35:19,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219703488] [2020-11-30 00:35:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-30 00:35:19,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219703488] [2020-11-30 00:35:19,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:19,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:19,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485167055] [2020-11-30 00:35:19,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:19,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:19,875 INFO L87 Difference]: Start difference. First operand 273 states and 381 transitions. Second operand 3 states. [2020-11-30 00:35:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:19,920 INFO L93 Difference]: Finished difference Result 579 states and 843 transitions. [2020-11-30 00:35:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:19,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-11-30 00:35:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:19,925 INFO L225 Difference]: With dead ends: 579 [2020-11-30 00:35:19,925 INFO L226 Difference]: Without dead ends: 409 [2020-11-30 00:35:19,926 INFO L677 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 [2020-11-30 00:35:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2020-11-30 00:35:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2020-11-30 00:35:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-11-30 00:35:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 373 transitions. [2020-11-30 00:35:19,942 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 373 transitions. Word has length 93 [2020-11-30 00:35:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:19,943 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 373 transitions. [2020-11-30 00:35:19,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 373 transitions. [2020-11-30 00:35:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-30 00:35:19,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:19,944 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:19,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:35:19,945 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1642862401, now seen corresponding path program 1 times [2020-11-30 00:35:19,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:19,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851745526] [2020-11-30 00:35:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-30 00:35:20,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851745526] [2020-11-30 00:35:20,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:20,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:20,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604808141] [2020-11-30 00:35:20,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:20,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:20,019 INFO L87 Difference]: Start difference. First operand 268 states and 373 transitions. Second operand 3 states. [2020-11-30 00:35:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:20,059 INFO L93 Difference]: Finished difference Result 559 states and 813 transitions. [2020-11-30 00:35:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-11-30 00:35:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:20,063 INFO L225 Difference]: With dead ends: 559 [2020-11-30 00:35:20,063 INFO L226 Difference]: Without dead ends: 394 [2020-11-30 00:35:20,064 INFO L677 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 [2020-11-30 00:35:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-11-30 00:35:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 264. [2020-11-30 00:35:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-11-30 00:35:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2020-11-30 00:35:20,079 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 98 [2020-11-30 00:35:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:20,080 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2020-11-30 00:35:20,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2020-11-30 00:35:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-30 00:35:20,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:20,081 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:20,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:35:20,082 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2033932067, now seen corresponding path program 1 times [2020-11-30 00:35:20,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:20,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526534152] [2020-11-30 00:35:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-30 00:35:20,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526534152] [2020-11-30 00:35:20,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:20,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:20,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240763663] [2020-11-30 00:35:20,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:20,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:20,175 INFO L87 Difference]: Start difference. First operand 264 states and 366 transitions. Second operand 3 states. [2020-11-30 00:35:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:20,207 INFO L93 Difference]: Finished difference Result 423 states and 605 transitions. [2020-11-30 00:35:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:20,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-11-30 00:35:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:20,210 INFO L225 Difference]: With dead ends: 423 [2020-11-30 00:35:20,210 INFO L226 Difference]: Without dead ends: 262 [2020-11-30 00:35:20,211 INFO L677 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 [2020-11-30 00:35:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-30 00:35:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2020-11-30 00:35:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-11-30 00:35:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2020-11-30 00:35:20,225 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 104 [2020-11-30 00:35:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:20,225 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2020-11-30 00:35:20,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2020-11-30 00:35:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-30 00:35:20,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:20,227 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:20,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:35:20,228 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash -386138298, now seen corresponding path program 1 times [2020-11-30 00:35:20,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:20,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354542787] [2020-11-30 00:35:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-30 00:35:20,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354542787] [2020-11-30 00:35:20,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:20,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:20,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133880095] [2020-11-30 00:35:20,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:20,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:20,311 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 3 states. [2020-11-30 00:35:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:20,329 INFO L93 Difference]: Finished difference Result 468 states and 667 transitions. [2020-11-30 00:35:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:20,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-11-30 00:35:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:20,332 INFO L225 Difference]: With dead ends: 468 [2020-11-30 00:35:20,332 INFO L226 Difference]: Without dead ends: 310 [2020-11-30 00:35:20,332 INFO L677 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 [2020-11-30 00:35:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-30 00:35:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 258. [2020-11-30 00:35:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-30 00:35:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 356 transitions. [2020-11-30 00:35:20,347 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 356 transitions. Word has length 111 [2020-11-30 00:35:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:20,347 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 356 transitions. [2020-11-30 00:35:20,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 356 transitions. [2020-11-30 00:35:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-30 00:35:20,349 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:20,349 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:20,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:35:20,350 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash 736213815, now seen corresponding path program 1 times [2020-11-30 00:35:20,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:20,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979012489] [2020-11-30 00:35:20,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-30 00:35:20,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979012489] [2020-11-30 00:35:20,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138191697] [2020-11-30 00:35:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:20,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:35:20,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-30 00:35:20,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:20,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-30 00:35:20,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114351781] [2020-11-30 00:35:20,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:35:20,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:35:20,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:35:20,691 INFO L87 Difference]: Start difference. First operand 258 states and 356 transitions. Second operand 6 states. [2020-11-30 00:35:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:20,812 INFO L93 Difference]: Finished difference Result 538 states and 742 transitions. [2020-11-30 00:35:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:20,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2020-11-30 00:35:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:20,815 INFO L225 Difference]: With dead ends: 538 [2020-11-30 00:35:20,815 INFO L226 Difference]: Without dead ends: 299 [2020-11-30 00:35:20,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:35:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-30 00:35:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2020-11-30 00:35:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-30 00:35:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 406 transitions. [2020-11-30 00:35:20,831 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 406 transitions. Word has length 114 [2020-11-30 00:35:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:20,831 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 406 transitions. [2020-11-30 00:35:20,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:35:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 406 transitions. [2020-11-30 00:35:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-30 00:35:20,833 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:20,834 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:21,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:21,047 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1415299624, now seen corresponding path program 2 times [2020-11-30 00:35:21,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:21,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831417220] [2020-11-30 00:35:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-30 00:35:21,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831417220] [2020-11-30 00:35:21,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:21,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:21,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108005296] [2020-11-30 00:35:21,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:21,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:21,191 INFO L87 Difference]: Start difference. First operand 299 states and 406 transitions. Second operand 3 states. [2020-11-30 00:35:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:21,231 INFO L93 Difference]: Finished difference Result 484 states and 674 transitions. [2020-11-30 00:35:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:21,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-11-30 00:35:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:21,234 INFO L225 Difference]: With dead ends: 484 [2020-11-30 00:35:21,234 INFO L226 Difference]: Without dead ends: 299 [2020-11-30 00:35:21,235 INFO L677 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 [2020-11-30 00:35:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-30 00:35:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2020-11-30 00:35:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-30 00:35:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2020-11-30 00:35:21,251 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 147 [2020-11-30 00:35:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:21,252 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2020-11-30 00:35:21,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2020-11-30 00:35:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-30 00:35:21,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:21,255 INFO L422 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] [2020-11-30 00:35:21,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:35:21,255 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -951384532, now seen corresponding path program 1 times [2020-11-30 00:35:21,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:21,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777154158] [2020-11-30 00:35:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:21,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777154158] [2020-11-30 00:35:21,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:21,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:21,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373091259] [2020-11-30 00:35:21,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:21,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:21,468 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand 4 states. [2020-11-30 00:35:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:21,601 INFO L93 Difference]: Finished difference Result 636 states and 897 transitions. [2020-11-30 00:35:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:21,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-11-30 00:35:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:21,606 INFO L225 Difference]: With dead ends: 636 [2020-11-30 00:35:21,607 INFO L226 Difference]: Without dead ends: 481 [2020-11-30 00:35:21,607 INFO L677 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 [2020-11-30 00:35:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-11-30 00:35:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 385. [2020-11-30 00:35:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-30 00:35:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 525 transitions. [2020-11-30 00:35:21,629 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 525 transitions. Word has length 159 [2020-11-30 00:35:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:21,629 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 525 transitions. [2020-11-30 00:35:21,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2020-11-30 00:35:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-30 00:35:21,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:21,632 INFO L422 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] [2020-11-30 00:35:21,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 00:35:21,639 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 584730604, now seen corresponding path program 1 times [2020-11-30 00:35:21,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:21,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753696968] [2020-11-30 00:35:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:21,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753696968] [2020-11-30 00:35:21,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:21,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:21,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308264683] [2020-11-30 00:35:21,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:21,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:21,761 INFO L87 Difference]: Start difference. First operand 385 states and 525 transitions. Second operand 3 states. [2020-11-30 00:35:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:21,811 INFO L93 Difference]: Finished difference Result 799 states and 1134 transitions. [2020-11-30 00:35:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:21,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-11-30 00:35:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:21,815 INFO L225 Difference]: With dead ends: 799 [2020-11-30 00:35:21,815 INFO L226 Difference]: Without dead ends: 599 [2020-11-30 00:35:21,816 INFO L677 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 [2020-11-30 00:35:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-11-30 00:35:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2020-11-30 00:35:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-11-30 00:35:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2020-11-30 00:35:21,865 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 177 [2020-11-30 00:35:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:21,866 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2020-11-30 00:35:21,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2020-11-30 00:35:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-30 00:35:21,868 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:21,868 INFO L422 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] [2020-11-30 00:35:21,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 00:35:21,869 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1981195457, now seen corresponding path program 1 times [2020-11-30 00:35:21,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:21,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127509850] [2020-11-30 00:35:21,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:21,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127509850] [2020-11-30 00:35:21,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:21,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:21,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754727212] [2020-11-30 00:35:22,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:22,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:22,001 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand 3 states. [2020-11-30 00:35:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:22,060 INFO L93 Difference]: Finished difference Result 955 states and 1354 transitions. [2020-11-30 00:35:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:22,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-30 00:35:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:22,065 INFO L225 Difference]: With dead ends: 955 [2020-11-30 00:35:22,065 INFO L226 Difference]: Without dead ends: 710 [2020-11-30 00:35:22,066 INFO L677 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 [2020-11-30 00:35:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2020-11-30 00:35:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 557. [2020-11-30 00:35:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-11-30 00:35:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 766 transitions. [2020-11-30 00:35:22,112 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 766 transitions. Word has length 178 [2020-11-30 00:35:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:22,112 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 766 transitions. [2020-11-30 00:35:22,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 766 transitions. [2020-11-30 00:35:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-30 00:35:22,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:22,115 INFO L422 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] [2020-11-30 00:35:22,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 00:35:22,116 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:22,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1520871577, now seen corresponding path program 1 times [2020-11-30 00:35:22,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:22,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923765449] [2020-11-30 00:35:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:22,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923765449] [2020-11-30 00:35:22,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:22,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:22,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654632798] [2020-11-30 00:35:22,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:22,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:22,247 INFO L87 Difference]: Start difference. First operand 557 states and 766 transitions. Second operand 3 states. [2020-11-30 00:35:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:22,318 INFO L93 Difference]: Finished difference Result 1135 states and 1616 transitions. [2020-11-30 00:35:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:22,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-30 00:35:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:22,324 INFO L225 Difference]: With dead ends: 1135 [2020-11-30 00:35:22,324 INFO L226 Difference]: Without dead ends: 824 [2020-11-30 00:35:22,325 INFO L677 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 [2020-11-30 00:35:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-11-30 00:35:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 643. [2020-11-30 00:35:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-11-30 00:35:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2020-11-30 00:35:22,373 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 179 [2020-11-30 00:35:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:22,374 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2020-11-30 00:35:22,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2020-11-30 00:35:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-30 00:35:22,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:22,377 INFO L422 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] [2020-11-30 00:35:22,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 00:35:22,377 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1302016859, now seen corresponding path program 1 times [2020-11-30 00:35:22,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:22,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975782985] [2020-11-30 00:35:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:35:22,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975782985] [2020-11-30 00:35:22,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723178589] [2020-11-30 00:35:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:35:22,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:22,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:35:22,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 00:35:22,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387853492] [2020-11-30 00:35:22,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:22,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:22,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:22,779 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand 3 states. [2020-11-30 00:35:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:22,901 INFO L93 Difference]: Finished difference Result 1287 states and 1778 transitions. [2020-11-30 00:35:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:22,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-30 00:35:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:22,907 INFO L225 Difference]: With dead ends: 1287 [2020-11-30 00:35:22,907 INFO L226 Difference]: Without dead ends: 898 [2020-11-30 00:35:22,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2020-11-30 00:35:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 643. [2020-11-30 00:35:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-11-30 00:35:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 885 transitions. [2020-11-30 00:35:22,950 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 885 transitions. Word has length 179 [2020-11-30 00:35:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:22,951 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 885 transitions. [2020-11-30 00:35:22,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 885 transitions. [2020-11-30 00:35:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-30 00:35:22,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:22,954 INFO L422 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] [2020-11-30 00:35:23,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-30 00:35:23,179 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -211146527, now seen corresponding path program 1 times [2020-11-30 00:35:23,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:23,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385581358] [2020-11-30 00:35:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:35:23,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385581358] [2020-11-30 00:35:23,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128255611] [2020-11-30 00:35:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:23,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:35:23,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:23,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:35:23,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 00:35:23,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363052237] [2020-11-30 00:35:23,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:23,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:23,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:23,554 INFO L87 Difference]: Start difference. First operand 643 states and 885 transitions. Second operand 3 states. [2020-11-30 00:35:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:23,699 INFO L93 Difference]: Finished difference Result 1519 states and 2130 transitions. [2020-11-30 00:35:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:23,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-30 00:35:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:23,706 INFO L225 Difference]: With dead ends: 1519 [2020-11-30 00:35:23,707 INFO L226 Difference]: Without dead ends: 1130 [2020-11-30 00:35:23,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-11-30 00:35:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 643. [2020-11-30 00:35:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-11-30 00:35:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 884 transitions. [2020-11-30 00:35:23,751 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 884 transitions. Word has length 180 [2020-11-30 00:35:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:23,752 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 884 transitions. [2020-11-30 00:35:23,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 884 transitions. [2020-11-30 00:35:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-30 00:35:23,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:23,755 INFO L422 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] [2020-11-30 00:35:23,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:23,971 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1535613927, now seen corresponding path program 1 times [2020-11-30 00:35:23,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:23,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766872045] [2020-11-30 00:35:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:35:24,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766872045] [2020-11-30 00:35:24,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844530254] [2020-11-30 00:35:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:24,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:35:24,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:24,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:35:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:24,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:35:24,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-11-30 00:35:24,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342806101] [2020-11-30 00:35:24,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:24,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:35:24,427 INFO L87 Difference]: Start difference. First operand 643 states and 884 transitions. Second operand 4 states. [2020-11-30 00:35:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:24,543 INFO L93 Difference]: Finished difference Result 1058 states and 1477 transitions. [2020-11-30 00:35:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:24,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-11-30 00:35:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:24,549 INFO L225 Difference]: With dead ends: 1058 [2020-11-30 00:35:24,550 INFO L226 Difference]: Without dead ends: 1056 [2020-11-30 00:35:24,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:35:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2020-11-30 00:35:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 645. [2020-11-30 00:35:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-11-30 00:35:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2020-11-30 00:35:24,595 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 181 [2020-11-30 00:35:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:24,596 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2020-11-30 00:35:24,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2020-11-30 00:35:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-30 00:35:24,599 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:24,599 INFO L422 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] [2020-11-30 00:35:24,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-11-30 00:35:24,815 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2070791213, now seen corresponding path program 1 times [2020-11-30 00:35:24,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:24,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359382827] [2020-11-30 00:35:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-30 00:35:25,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359382827] [2020-11-30 00:35:25,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540471517] [2020-11-30 00:35:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:25,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:35:25,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-30 00:35:25,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:25,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-11-30 00:35:25,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506680168] [2020-11-30 00:35:25,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:35:25,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:35:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:35:25,319 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand 11 states. [2020-11-30 00:35:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:26,173 INFO L93 Difference]: Finished difference Result 3897 states and 5558 transitions. [2020-11-30 00:35:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 00:35:26,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-11-30 00:35:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:26,193 INFO L225 Difference]: With dead ends: 3897 [2020-11-30 00:35:26,193 INFO L226 Difference]: Without dead ends: 3506 [2020-11-30 00:35:26,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2020-11-30 00:35:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2020-11-30 00:35:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 871. [2020-11-30 00:35:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-11-30 00:35:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1176 transitions. [2020-11-30 00:35:26,307 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1176 transitions. Word has length 184 [2020-11-30 00:35:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:26,307 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 1176 transitions. [2020-11-30 00:35:26,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:35:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1176 transitions. [2020-11-30 00:35:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-30 00:35:26,310 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:26,311 INFO L422 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] [2020-11-30 00:35:26,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-30 00:35:26,531 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 790927535, now seen corresponding path program 1 times [2020-11-30 00:35:26,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:26,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102938711] [2020-11-30 00:35:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:26,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102938711] [2020-11-30 00:35:26,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:26,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:26,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558789151] [2020-11-30 00:35:26,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:26,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:26,622 INFO L87 Difference]: Start difference. First operand 871 states and 1176 transitions. Second operand 3 states. [2020-11-30 00:35:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:26,816 INFO L93 Difference]: Finished difference Result 1949 states and 2675 transitions. [2020-11-30 00:35:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:26,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-11-30 00:35:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:26,827 INFO L225 Difference]: With dead ends: 1949 [2020-11-30 00:35:26,827 INFO L226 Difference]: Without dead ends: 1558 [2020-11-30 00:35:26,829 INFO L677 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 [2020-11-30 00:35:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2020-11-30 00:35:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 871. [2020-11-30 00:35:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-11-30 00:35:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1174 transitions. [2020-11-30 00:35:26,912 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1174 transitions. Word has length 184 [2020-11-30 00:35:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:26,912 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 1174 transitions. [2020-11-30 00:35:26,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1174 transitions. [2020-11-30 00:35:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-11-30 00:35:26,915 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:26,916 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:26,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 00:35:26,916 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash -201861067, now seen corresponding path program 1 times [2020-11-30 00:35:26,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:26,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000092285] [2020-11-30 00:35:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:35:27,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000092285] [2020-11-30 00:35:27,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:27,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:35:27,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147077943] [2020-11-30 00:35:27,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:35:27,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:35:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:35:27,031 INFO L87 Difference]: Start difference. First operand 871 states and 1174 transitions. Second operand 3 states. [2020-11-30 00:35:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:27,137 INFO L93 Difference]: Finished difference Result 1463 states and 1989 transitions. [2020-11-30 00:35:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:35:27,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2020-11-30 00:35:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:27,142 INFO L225 Difference]: With dead ends: 1463 [2020-11-30 00:35:27,142 INFO L226 Difference]: Without dead ends: 713 [2020-11-30 00:35:27,143 INFO L677 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 [2020-11-30 00:35:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-11-30 00:35:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2020-11-30 00:35:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-11-30 00:35:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 941 transitions. [2020-11-30 00:35:27,204 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 941 transitions. Word has length 187 [2020-11-30 00:35:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:27,204 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 941 transitions. [2020-11-30 00:35:27,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:35:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 941 transitions. [2020-11-30 00:35:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-30 00:35:27,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:27,208 INFO L422 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] [2020-11-30 00:35:27,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 00:35:27,208 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 275807609, now seen corresponding path program 1 times [2020-11-30 00:35:27,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:27,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029505358] [2020-11-30 00:35:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:27,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029505358] [2020-11-30 00:35:27,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:27,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:35:27,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914984117] [2020-11-30 00:35:27,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:35:27,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:35:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:35:27,437 INFO L87 Difference]: Start difference. First operand 712 states and 941 transitions. Second operand 9 states. [2020-11-30 00:35:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:29,343 INFO L93 Difference]: Finished difference Result 2511 states and 3398 transitions. [2020-11-30 00:35:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:35:29,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2020-11-30 00:35:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:29,366 INFO L225 Difference]: With dead ends: 2511 [2020-11-30 00:35:29,372 INFO L226 Difference]: Without dead ends: 2131 [2020-11-30 00:35:29,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 00:35:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2020-11-30 00:35:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 823. [2020-11-30 00:35:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2020-11-30 00:35:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1081 transitions. [2020-11-30 00:35:29,459 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1081 transitions. Word has length 192 [2020-11-30 00:35:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:29,460 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1081 transitions. [2020-11-30 00:35:29,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:35:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1081 transitions. [2020-11-30 00:35:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-30 00:35:29,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:29,464 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:29,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 00:35:29,464 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash -956407183, now seen corresponding path program 1 times [2020-11-30 00:35:29,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:29,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772653362] [2020-11-30 00:35:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:29,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772653362] [2020-11-30 00:35:29,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:29,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:35:29,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845218480] [2020-11-30 00:35:29,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:35:29,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:35:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:35:29,594 INFO L87 Difference]: Start difference. First operand 823 states and 1081 transitions. Second operand 6 states. [2020-11-30 00:35:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:29,876 INFO L93 Difference]: Finished difference Result 2682 states and 3653 transitions. [2020-11-30 00:35:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:35:29,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2020-11-30 00:35:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:29,884 INFO L225 Difference]: With dead ends: 2682 [2020-11-30 00:35:29,884 INFO L226 Difference]: Without dead ends: 2185 [2020-11-30 00:35:29,885 INFO L677 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 [2020-11-30 00:35:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2020-11-30 00:35:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 900. [2020-11-30 00:35:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2020-11-30 00:35:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1179 transitions. [2020-11-30 00:35:29,983 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1179 transitions. Word has length 198 [2020-11-30 00:35:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:29,984 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 1179 transitions. [2020-11-30 00:35:29,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:35:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1179 transitions. [2020-11-30 00:35:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-30 00:35:29,987 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:29,987 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:29,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 00:35:29,988 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -198084303, now seen corresponding path program 1 times [2020-11-30 00:35:29,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:29,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203454002] [2020-11-30 00:35:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:30,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203454002] [2020-11-30 00:35:30,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:30,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:35:30,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569957166] [2020-11-30 00:35:30,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:35:30,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:35:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:35:30,197 INFO L87 Difference]: Start difference. First operand 900 states and 1179 transitions. Second operand 7 states. [2020-11-30 00:35:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:30,993 INFO L93 Difference]: Finished difference Result 2095 states and 2770 transitions. [2020-11-30 00:35:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:35:30,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2020-11-30 00:35:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:31,005 INFO L225 Difference]: With dead ends: 2095 [2020-11-30 00:35:31,005 INFO L226 Difference]: Without dead ends: 1524 [2020-11-30 00:35:31,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:35:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2020-11-30 00:35:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 962. [2020-11-30 00:35:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2020-11-30 00:35:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1249 transitions. [2020-11-30 00:35:31,122 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1249 transitions. Word has length 198 [2020-11-30 00:35:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:31,123 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1249 transitions. [2020-11-30 00:35:31,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:35:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1249 transitions. [2020-11-30 00:35:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-30 00:35:31,127 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:31,128 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:31,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 00:35:31,128 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1920217235, now seen corresponding path program 1 times [2020-11-30 00:35:31,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:31,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348072078] [2020-11-30 00:35:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:31,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348072078] [2020-11-30 00:35:31,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:31,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:35:31,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250656401] [2020-11-30 00:35:31,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:35:31,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:35:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:35:31,463 INFO L87 Difference]: Start difference. First operand 962 states and 1249 transitions. Second operand 9 states. [2020-11-30 00:35:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:33,251 INFO L93 Difference]: Finished difference Result 3095 states and 4041 transitions. [2020-11-30 00:35:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 00:35:33,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2020-11-30 00:35:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:33,259 INFO L225 Difference]: With dead ends: 3095 [2020-11-30 00:35:33,259 INFO L226 Difference]: Without dead ends: 2467 [2020-11-30 00:35:33,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-11-30 00:35:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2020-11-30 00:35:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1203. [2020-11-30 00:35:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-11-30 00:35:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1537 transitions. [2020-11-30 00:35:33,455 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1537 transitions. Word has length 198 [2020-11-30 00:35:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:33,456 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1537 transitions. [2020-11-30 00:35:33,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:35:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1537 transitions. [2020-11-30 00:35:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-30 00:35:33,461 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:33,461 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:33,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 00:35:33,462 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1523967073, now seen corresponding path program 1 times [2020-11-30 00:35:33,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:33,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962306399] [2020-11-30 00:35:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-30 00:35:33,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962306399] [2020-11-30 00:35:33,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:33,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:33,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206320363] [2020-11-30 00:35:33,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:33,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:35:33,606 INFO L87 Difference]: Start difference. First operand 1203 states and 1537 transitions. Second operand 4 states. [2020-11-30 00:35:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:33,930 INFO L93 Difference]: Finished difference Result 2182 states and 2820 transitions. [2020-11-30 00:35:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:33,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2020-11-30 00:35:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:33,935 INFO L225 Difference]: With dead ends: 2182 [2020-11-30 00:35:33,935 INFO L226 Difference]: Without dead ends: 1311 [2020-11-30 00:35:33,937 INFO L677 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 [2020-11-30 00:35:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2020-11-30 00:35:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 977. [2020-11-30 00:35:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-11-30 00:35:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1232 transitions. [2020-11-30 00:35:34,076 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1232 transitions. Word has length 207 [2020-11-30 00:35:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:34,077 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1232 transitions. [2020-11-30 00:35:34,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1232 transitions. [2020-11-30 00:35:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-30 00:35:34,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:34,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:34,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 00:35:34,084 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1323345434, now seen corresponding path program 1 times [2020-11-30 00:35:34,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:34,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701259855] [2020-11-30 00:35:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:35:34,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701259855] [2020-11-30 00:35:34,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460146756] [2020-11-30 00:35:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:34,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:35:34,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-11-30 00:35:35,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:35:35,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:35:35,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550366748] [2020-11-30 00:35:35,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:35:35,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:35,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:35:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:35:35,032 INFO L87 Difference]: Start difference. First operand 977 states and 1232 transitions. Second operand 4 states. [2020-11-30 00:35:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:35,199 INFO L93 Difference]: Finished difference Result 1675 states and 2121 transitions. [2020-11-30 00:35:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:35:35,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2020-11-30 00:35:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:35,202 INFO L225 Difference]: With dead ends: 1675 [2020-11-30 00:35:35,203 INFO L226 Difference]: Without dead ends: 927 [2020-11-30 00:35:35,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:35:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-11-30 00:35:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2020-11-30 00:35:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-11-30 00:35:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1156 transitions. [2020-11-30 00:35:35,293 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1156 transitions. Word has length 232 [2020-11-30 00:35:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:35,293 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1156 transitions. [2020-11-30 00:35:35,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:35:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1156 transitions. [2020-11-30 00:35:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-30 00:35:35,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:35,297 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:35,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-11-30 00:35:35,523 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1544471264, now seen corresponding path program 1 times [2020-11-30 00:35:35,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:35,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629650786] [2020-11-30 00:35:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:35,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629650786] [2020-11-30 00:35:35,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112614094] [2020-11-30 00:35:35,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:36,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:35:36,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:36,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:36,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:35:36,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053529070] [2020-11-30 00:35:36,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:35:36,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:35:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:35:36,645 INFO L87 Difference]: Start difference. First operand 927 states and 1156 transitions. Second operand 21 states. [2020-11-30 00:35:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:40,729 INFO L93 Difference]: Finished difference Result 7435 states and 9578 transitions. [2020-11-30 00:35:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:35:40,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 234 [2020-11-30 00:35:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:40,746 INFO L225 Difference]: With dead ends: 7435 [2020-11-30 00:35:40,746 INFO L226 Difference]: Without dead ends: 6835 [2020-11-30 00:35:40,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1884, Invalid=8216, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:35:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2020-11-30 00:35:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 2215. [2020-11-30 00:35:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2020-11-30 00:35:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2790 transitions. [2020-11-30 00:35:41,125 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2790 transitions. Word has length 234 [2020-11-30 00:35:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:41,125 INFO L481 AbstractCegarLoop]: Abstraction has 2215 states and 2790 transitions. [2020-11-30 00:35:41,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:35:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2790 transitions. [2020-11-30 00:35:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-30 00:35:41,132 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:41,133 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:41,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-30 00:35:41,346 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash 487740062, now seen corresponding path program 1 times [2020-11-30 00:35:41,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:41,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493128383] [2020-11-30 00:35:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-11-30 00:35:41,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493128383] [2020-11-30 00:35:41,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:41,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:41,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809028939] [2020-11-30 00:35:41,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:41,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:41,615 INFO L87 Difference]: Start difference. First operand 2215 states and 2790 transitions. Second operand 5 states. [2020-11-30 00:35:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:41,923 INFO L93 Difference]: Finished difference Result 4100 states and 5182 transitions. [2020-11-30 00:35:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:41,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2020-11-30 00:35:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:41,929 INFO L225 Difference]: With dead ends: 4100 [2020-11-30 00:35:41,929 INFO L226 Difference]: Without dead ends: 2215 [2020-11-30 00:35:41,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2020-11-30 00:35:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2020-11-30 00:35:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2020-11-30 00:35:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2787 transitions. [2020-11-30 00:35:42,194 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2787 transitions. Word has length 234 [2020-11-30 00:35:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:42,194 INFO L481 AbstractCegarLoop]: Abstraction has 2215 states and 2787 transitions. [2020-11-30 00:35:42,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:35:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2787 transitions. [2020-11-30 00:35:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-30 00:35:42,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:42,200 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:42,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-30 00:35:42,200 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2101020871, now seen corresponding path program 1 times [2020-11-30 00:35:42,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:42,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563021889] [2020-11-30 00:35:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-30 00:35:42,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563021889] [2020-11-30 00:35:42,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:42,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:42,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655009573] [2020-11-30 00:35:42,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:42,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:42,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:42,459 INFO L87 Difference]: Start difference. First operand 2215 states and 2787 transitions. Second operand 5 states. [2020-11-30 00:35:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:42,811 INFO L93 Difference]: Finished difference Result 4201 states and 5296 transitions. [2020-11-30 00:35:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:42,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2020-11-30 00:35:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:42,817 INFO L225 Difference]: With dead ends: 4201 [2020-11-30 00:35:42,817 INFO L226 Difference]: Without dead ends: 2251 [2020-11-30 00:35:42,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2020-11-30 00:35:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2242. [2020-11-30 00:35:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-11-30 00:35:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2814 transitions. [2020-11-30 00:35:43,143 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2814 transitions. Word has length 235 [2020-11-30 00:35:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:43,144 INFO L481 AbstractCegarLoop]: Abstraction has 2242 states and 2814 transitions. [2020-11-30 00:35:43,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:35:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2814 transitions. [2020-11-30 00:35:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-30 00:35:43,150 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:43,151 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:43,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-30 00:35:43,151 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash -253364411, now seen corresponding path program 1 times [2020-11-30 00:35:43,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:43,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039517821] [2020-11-30 00:35:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:43,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039517821] [2020-11-30 00:35:43,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735220649] [2020-11-30 00:35:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:43,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:35:43,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:44,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:44,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 00:35:44,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947251838] [2020-11-30 00:35:44,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:35:44,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:35:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:35:44,262 INFO L87 Difference]: Start difference. First operand 2242 states and 2814 transitions. Second operand 22 states. [2020-11-30 00:35:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:49,052 INFO L93 Difference]: Finished difference Result 17003 states and 21716 transitions. [2020-11-30 00:35:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2020-11-30 00:35:49,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 235 [2020-11-30 00:35:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:49,080 INFO L225 Difference]: With dead ends: 17003 [2020-11-30 00:35:49,081 INFO L226 Difference]: Without dead ends: 15218 [2020-11-30 00:35:49,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2024, Invalid=9318, Unknown=0, NotChecked=0, Total=11342 [2020-11-30 00:35:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15218 states. [2020-11-30 00:35:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15218 to 4825. [2020-11-30 00:35:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2020-11-30 00:35:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6134 transitions. [2020-11-30 00:35:49,673 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6134 transitions. Word has length 235 [2020-11-30 00:35:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:49,674 INFO L481 AbstractCegarLoop]: Abstraction has 4825 states and 6134 transitions. [2020-11-30 00:35:49,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:35:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6134 transitions. [2020-11-30 00:35:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-30 00:35:49,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:49,684 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:49,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:49,899 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 251060818, now seen corresponding path program 1 times [2020-11-30 00:35:49,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:49,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981771735] [2020-11-30 00:35:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:50,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981771735] [2020-11-30 00:35:50,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400301672] [2020-11-30 00:35:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:50,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:35:50,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:35:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:35:50,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:35:50,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:35:50,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831182607] [2020-11-30 00:35:50,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:35:50,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:35:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:35:50,895 INFO L87 Difference]: Start difference. First operand 4825 states and 6134 transitions. Second operand 21 states. [2020-11-30 00:35:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:57,225 INFO L93 Difference]: Finished difference Result 33087 states and 42974 transitions. [2020-11-30 00:35:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:35:57,226 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 235 [2020-11-30 00:35:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:57,270 INFO L225 Difference]: With dead ends: 33087 [2020-11-30 00:35:57,270 INFO L226 Difference]: Without dead ends: 28902 [2020-11-30 00:35:57,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3461 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:35:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28902 states. [2020-11-30 00:35:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28902 to 4840. [2020-11-30 00:35:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2020-11-30 00:35:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 6154 transitions. [2020-11-30 00:35:58,007 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 6154 transitions. Word has length 235 [2020-11-30 00:35:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:58,008 INFO L481 AbstractCegarLoop]: Abstraction has 4840 states and 6154 transitions. [2020-11-30 00:35:58,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:35:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 6154 transitions. [2020-11-30 00:35:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-30 00:35:58,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:58,015 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:58,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:35:58,236 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -805670384, now seen corresponding path program 1 times [2020-11-30 00:35:58,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:58,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071848118] [2020-11-30 00:35:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-11-30 00:35:58,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071848118] [2020-11-30 00:35:58,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:58,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:58,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372997329] [2020-11-30 00:35:58,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:58,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:58,444 INFO L87 Difference]: Start difference. First operand 4840 states and 6154 transitions. Second operand 5 states. [2020-11-30 00:35:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:35:58,946 INFO L93 Difference]: Finished difference Result 9241 states and 11781 transitions. [2020-11-30 00:35:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:35:58,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2020-11-30 00:35:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:35:58,954 INFO L225 Difference]: With dead ends: 9241 [2020-11-30 00:35:58,954 INFO L226 Difference]: Without dead ends: 4845 [2020-11-30 00:35:58,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2020-11-30 00:35:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4825. [2020-11-30 00:35:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2020-11-30 00:35:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6134 transitions. [2020-11-30 00:35:59,488 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6134 transitions. Word has length 235 [2020-11-30 00:35:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:35:59,488 INFO L481 AbstractCegarLoop]: Abstraction has 4825 states and 6134 transitions. [2020-11-30 00:35:59,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:35:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6134 transitions. [2020-11-30 00:35:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:35:59,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:35:59,497 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:35:59,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-30 00:35:59,497 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:35:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:35:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1653083233, now seen corresponding path program 1 times [2020-11-30 00:35:59,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:35:59,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146977482] [2020-11-30 00:35:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:35:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:35:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-30 00:35:59,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146977482] [2020-11-30 00:35:59,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:35:59,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:35:59,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907641673] [2020-11-30 00:35:59,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:35:59,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:35:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:35:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:35:59,714 INFO L87 Difference]: Start difference. First operand 4825 states and 6134 transitions. Second operand 5 states. [2020-11-30 00:36:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:00,320 INFO L93 Difference]: Finished difference Result 9253 states and 11793 transitions. [2020-11-30 00:36:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:36:00,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2020-11-30 00:36:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:00,324 INFO L225 Difference]: With dead ends: 9253 [2020-11-30 00:36:00,324 INFO L226 Difference]: Without dead ends: 4885 [2020-11-30 00:36:00,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:36:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2020-11-30 00:36:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4870. [2020-11-30 00:36:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2020-11-30 00:36:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 6179 transitions. [2020-11-30 00:36:00,990 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 6179 transitions. Word has length 236 [2020-11-30 00:36:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:00,991 INFO L481 AbstractCegarLoop]: Abstraction has 4870 states and 6179 transitions. [2020-11-30 00:36:00,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:36:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 6179 transitions. [2020-11-30 00:36:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:36:01,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:01,000 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:01,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-30 00:36:01,001 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash -701302049, now seen corresponding path program 1 times [2020-11-30 00:36:01,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:01,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929753692] [2020-11-30 00:36:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:01,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929753692] [2020-11-30 00:36:01,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542126623] [2020-11-30 00:36:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:36:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:01,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:36:01,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:36:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:01,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:36:01,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 00:36:01,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395252106] [2020-11-30 00:36:01,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:36:01,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:36:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:36:01,991 INFO L87 Difference]: Start difference. First operand 4870 states and 6179 transitions. Second operand 22 states. [2020-11-30 00:36:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:09,416 INFO L93 Difference]: Finished difference Result 30051 states and 38627 transitions. [2020-11-30 00:36:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2020-11-30 00:36:09,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 236 [2020-11-30 00:36:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:09,437 INFO L225 Difference]: With dead ends: 30051 [2020-11-30 00:36:09,437 INFO L226 Difference]: Without dead ends: 25830 [2020-11-30 00:36:09,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3906 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2016, Invalid=9326, Unknown=0, NotChecked=0, Total=11342 [2020-11-30 00:36:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25830 states. [2020-11-30 00:36:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25830 to 4825. [2020-11-30 00:36:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2020-11-30 00:36:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6134 transitions. [2020-11-30 00:36:10,264 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6134 transitions. Word has length 236 [2020-11-30 00:36:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:10,264 INFO L481 AbstractCegarLoop]: Abstraction has 4825 states and 6134 transitions. [2020-11-30 00:36:10,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:36:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6134 transitions. [2020-11-30 00:36:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:36:10,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:10,271 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:10,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-11-30 00:36:10,472 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 345983495, now seen corresponding path program 1 times [2020-11-30 00:36:10,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:10,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529773016] [2020-11-30 00:36:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:36:10,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529773016] [2020-11-30 00:36:10,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530123717] [2020-11-30 00:36:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:36:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:11,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:36:11,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:36:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:11,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:36:11,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-30 00:36:11,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149216333] [2020-11-30 00:36:11,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 00:36:11,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 00:36:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:36:11,353 INFO L87 Difference]: Start difference. First operand 4825 states and 6134 transitions. Second operand 15 states. [2020-11-30 00:36:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:20,013 INFO L93 Difference]: Finished difference Result 35364 states and 45433 transitions. [2020-11-30 00:36:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-11-30 00:36:20,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2020-11-30 00:36:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:20,039 INFO L225 Difference]: With dead ends: 35364 [2020-11-30 00:36:20,039 INFO L226 Difference]: Without dead ends: 30973 [2020-11-30 00:36:20,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1592, Invalid=15438, Unknown=0, NotChecked=0, Total=17030 [2020-11-30 00:36:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30973 states. [2020-11-30 00:36:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30973 to 8138. [2020-11-30 00:36:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8138 states. [2020-11-30 00:36:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8138 states to 8138 states and 10028 transitions. [2020-11-30 00:36:21,383 INFO L78 Accepts]: Start accepts. Automaton has 8138 states and 10028 transitions. Word has length 236 [2020-11-30 00:36:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:21,384 INFO L481 AbstractCegarLoop]: Abstraction has 8138 states and 10028 transitions. [2020-11-30 00:36:21,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 00:36:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 8138 states and 10028 transitions. [2020-11-30 00:36:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:36:21,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:21,395 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:21,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-11-30 00:36:21,596 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1983267709, now seen corresponding path program 1 times [2020-11-30 00:36:21,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:21,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870425899] [2020-11-30 00:36:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-11-30 00:36:21,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870425899] [2020-11-30 00:36:21,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:36:21,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:36:21,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130424562] [2020-11-30 00:36:21,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:36:21,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:36:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:36:21,750 INFO L87 Difference]: Start difference. First operand 8138 states and 10028 transitions. Second operand 3 states. [2020-11-30 00:36:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:22,956 INFO L93 Difference]: Finished difference Result 16066 states and 19758 transitions. [2020-11-30 00:36:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:36:22,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2020-11-30 00:36:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:22,971 INFO L225 Difference]: With dead ends: 16066 [2020-11-30 00:36:22,971 INFO L226 Difference]: Without dead ends: 8735 [2020-11-30 00:36:22,978 INFO L677 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 [2020-11-30 00:36:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2020-11-30 00:36:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 8054. [2020-11-30 00:36:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8054 states. [2020-11-30 00:36:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8054 states to 8054 states and 9566 transitions. [2020-11-30 00:36:24,060 INFO L78 Accepts]: Start accepts. Automaton has 8054 states and 9566 transitions. Word has length 236 [2020-11-30 00:36:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:24,060 INFO L481 AbstractCegarLoop]: Abstraction has 8054 states and 9566 transitions. [2020-11-30 00:36:24,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:36:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8054 states and 9566 transitions. [2020-11-30 00:36:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-30 00:36:24,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:24,070 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:24,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-30 00:36:24,070 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 858215434, now seen corresponding path program 1 times [2020-11-30 00:36:24,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:24,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175745878] [2020-11-30 00:36:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-30 00:36:24,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175745878] [2020-11-30 00:36:24,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:36:24,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:36:24,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685060241] [2020-11-30 00:36:24,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:36:24,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:36:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:36:24,153 INFO L87 Difference]: Start difference. First operand 8054 states and 9566 transitions. Second operand 3 states. [2020-11-30 00:36:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:25,396 INFO L93 Difference]: Finished difference Result 15680 states and 18611 transitions. [2020-11-30 00:36:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:36:25,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2020-11-30 00:36:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:25,404 INFO L225 Difference]: With dead ends: 15680 [2020-11-30 00:36:25,404 INFO L226 Difference]: Without dead ends: 7639 [2020-11-30 00:36:25,411 INFO L677 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 [2020-11-30 00:36:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2020-11-30 00:36:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 7639. [2020-11-30 00:36:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7639 states. [2020-11-30 00:36:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7639 states to 7639 states and 9051 transitions. [2020-11-30 00:36:26,453 INFO L78 Accepts]: Start accepts. Automaton has 7639 states and 9051 transitions. Word has length 245 [2020-11-30 00:36:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:26,454 INFO L481 AbstractCegarLoop]: Abstraction has 7639 states and 9051 transitions. [2020-11-30 00:36:26,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:36:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7639 states and 9051 transitions. [2020-11-30 00:36:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-11-30 00:36:26,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:26,467 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:26,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-30 00:36:26,468 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 72328311, now seen corresponding path program 1 times [2020-11-30 00:36:26,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:26,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136312175] [2020-11-30 00:36:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:26,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136312175] [2020-11-30 00:36:26,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916373443] [2020-11-30 00:36:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:36:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:27,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:36:27,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:36:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:27,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:36:27,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-11-30 00:36:27,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721913787] [2020-11-30 00:36:27,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:36:27,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:36:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:36:27,225 INFO L87 Difference]: Start difference. First operand 7639 states and 9051 transitions. Second operand 8 states. [2020-11-30 00:36:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:32,958 INFO L93 Difference]: Finished difference Result 39153 states and 46963 transitions. [2020-11-30 00:36:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:36:32,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2020-11-30 00:36:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:32,983 INFO L225 Difference]: With dead ends: 39153 [2020-11-30 00:36:32,983 INFO L226 Difference]: Without dead ends: 32158 [2020-11-30 00:36:32,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:36:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32158 states. [2020-11-30 00:36:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32158 to 18136. [2020-11-30 00:36:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18136 states. [2020-11-30 00:36:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18136 states to 18136 states and 21411 transitions. [2020-11-30 00:36:35,210 INFO L78 Accepts]: Start accepts. Automaton has 18136 states and 21411 transitions. Word has length 248 [2020-11-30 00:36:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:35,210 INFO L481 AbstractCegarLoop]: Abstraction has 18136 states and 21411 transitions. [2020-11-30 00:36:35,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:36:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18136 states and 21411 transitions. [2020-11-30 00:36:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-11-30 00:36:35,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:35,227 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:35,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-11-30 00:36:35,429 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -220338395, now seen corresponding path program 1 times [2020-11-30 00:36:35,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:35,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066603884] [2020-11-30 00:36:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:35,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066603884] [2020-11-30 00:36:35,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480808991] [2020-11-30 00:36:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:36:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:36,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:36:36,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:36:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:36:36,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:36:36,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:36:36,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049257135] [2020-11-30 00:36:36,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:36:36,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:36:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:36:36,424 INFO L87 Difference]: Start difference. First operand 18136 states and 21411 transitions. Second operand 21 states. [2020-11-30 00:36:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:51,718 INFO L93 Difference]: Finished difference Result 91719 states and 110374 transitions. [2020-11-30 00:36:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:36:51,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 248 [2020-11-30 00:36:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:51,785 INFO L225 Difference]: With dead ends: 91719 [2020-11-30 00:36:51,785 INFO L226 Difference]: Without dead ends: 74459 [2020-11-30 00:36:51,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:36:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74459 states. [2020-11-30 00:36:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74459 to 18169. [2020-11-30 00:36:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18169 states. [2020-11-30 00:36:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18169 states to 18169 states and 21455 transitions. [2020-11-30 00:36:54,582 INFO L78 Accepts]: Start accepts. Automaton has 18169 states and 21455 transitions. Word has length 248 [2020-11-30 00:36:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:54,582 INFO L481 AbstractCegarLoop]: Abstraction has 18169 states and 21455 transitions. [2020-11-30 00:36:54,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:36:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 18169 states and 21455 transitions. [2020-11-30 00:36:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-11-30 00:36:54,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:36:54,600 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:36:54,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:36:54,827 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:36:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:36:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2101463523, now seen corresponding path program 1 times [2020-11-30 00:36:54,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:36:54,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663918565] [2020-11-30 00:36:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:36:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:36:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-11-30 00:36:55,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663918565] [2020-11-30 00:36:55,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:36:55,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:36:55,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283225302] [2020-11-30 00:36:55,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:36:55,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:36:55,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:36:55,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:36:55,048 INFO L87 Difference]: Start difference. First operand 18169 states and 21455 transitions. Second operand 5 states. [2020-11-30 00:36:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:36:57,501 INFO L93 Difference]: Finished difference Result 35692 states and 42192 transitions. [2020-11-30 00:36:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:36:57,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2020-11-30 00:36:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:36:57,517 INFO L225 Difference]: With dead ends: 35692 [2020-11-30 00:36:57,518 INFO L226 Difference]: Without dead ends: 18180 [2020-11-30 00:36:57,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:36:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18180 states. [2020-11-30 00:36:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18180 to 18136. [2020-11-30 00:36:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18136 states. [2020-11-30 00:36:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18136 states to 18136 states and 21411 transitions. [2020-11-30 00:36:59,991 INFO L78 Accepts]: Start accepts. Automaton has 18136 states and 21411 transitions. Word has length 248 [2020-11-30 00:36:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:36:59,992 INFO L481 AbstractCegarLoop]: Abstraction has 18136 states and 21411 transitions. [2020-11-30 00:36:59,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:36:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18136 states and 21411 transitions. [2020-11-30 00:37:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-11-30 00:37:00,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:00,004 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:00,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-30 00:37:00,004 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1867701337, now seen corresponding path program 1 times [2020-11-30 00:37:00,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:00,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330374715] [2020-11-30 00:37:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 00:37:00,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330374715] [2020-11-30 00:37:00,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679246720] [2020-11-30 00:37:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:00,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:37:00,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-11-30 00:37:00,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:37:00,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:37:00,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473341037] [2020-11-30 00:37:00,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:37:00,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:37:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:37:00,607 INFO L87 Difference]: Start difference. First operand 18136 states and 21411 transitions. Second operand 4 states. [2020-11-30 00:37:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:02,236 INFO L93 Difference]: Finished difference Result 26780 states and 31714 transitions. [2020-11-30 00:37:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:37:02,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2020-11-30 00:37:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:02,246 INFO L225 Difference]: With dead ends: 26780 [2020-11-30 00:37:02,246 INFO L226 Difference]: Without dead ends: 9281 [2020-11-30 00:37:02,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:37:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2020-11-30 00:37:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9281. [2020-11-30 00:37:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2020-11-30 00:37:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 11002 transitions. [2020-11-30 00:37:03,696 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 11002 transitions. Word has length 248 [2020-11-30 00:37:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:03,696 INFO L481 AbstractCegarLoop]: Abstraction has 9281 states and 11002 transitions. [2020-11-30 00:37:03,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:37:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 11002 transitions. [2020-11-30 00:37:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-30 00:37:03,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:03,704 INFO L422 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] [2020-11-30 00:37:03,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:03,931 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -387508996, now seen corresponding path program 1 times [2020-11-30 00:37:03,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:03,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634262479] [2020-11-30 00:37:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 00:37:04,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634262479] [2020-11-30 00:37:04,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888663759] [2020-11-30 00:37:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:04,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:37:04,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:37:04,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:37:04,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2020-11-30 00:37:04,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392539332] [2020-11-30 00:37:04,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:37:04,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:04,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:37:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:37:04,722 INFO L87 Difference]: Start difference. First operand 9281 states and 11002 transitions. Second operand 7 states. [2020-11-30 00:37:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:08,667 INFO L93 Difference]: Finished difference Result 28832 states and 34759 transitions. [2020-11-30 00:37:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 00:37:08,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2020-11-30 00:37:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:08,683 INFO L225 Difference]: With dead ends: 28832 [2020-11-30 00:37:08,684 INFO L226 Difference]: Without dead ends: 20202 [2020-11-30 00:37:08,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-11-30 00:37:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20202 states. [2020-11-30 00:37:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20202 to 5171. [2020-11-30 00:37:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5171 states. [2020-11-30 00:37:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 6122 transitions. [2020-11-30 00:37:09,516 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 6122 transitions. Word has length 249 [2020-11-30 00:37:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:09,516 INFO L481 AbstractCegarLoop]: Abstraction has 5171 states and 6122 transitions. [2020-11-30 00:37:09,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:37:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 6122 transitions. [2020-11-30 00:37:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-30 00:37:09,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:09,520 INFO L422 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] [2020-11-30 00:37:09,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:09,722 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash 573999369, now seen corresponding path program 1 times [2020-11-30 00:37:09,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:09,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099555233] [2020-11-30 00:37:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:37:09,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099555233] [2020-11-30 00:37:09,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:09,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:37:09,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210635040] [2020-11-30 00:37:09,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:37:09,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:37:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:09,861 INFO L87 Difference]: Start difference. First operand 5171 states and 6122 transitions. Second operand 7 states. [2020-11-30 00:37:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:11,530 INFO L93 Difference]: Finished difference Result 12184 states and 14682 transitions. [2020-11-30 00:37:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:37:11,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2020-11-30 00:37:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:11,536 INFO L225 Difference]: With dead ends: 12184 [2020-11-30 00:37:11,536 INFO L226 Difference]: Without dead ends: 7548 [2020-11-30 00:37:11,539 INFO L677 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 [2020-11-30 00:37:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2020-11-30 00:37:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 5646. [2020-11-30 00:37:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2020-11-30 00:37:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 6687 transitions. [2020-11-30 00:37:12,393 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 6687 transitions. Word has length 249 [2020-11-30 00:37:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:12,393 INFO L481 AbstractCegarLoop]: Abstraction has 5646 states and 6687 transitions. [2020-11-30 00:37:12,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:37:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 6687 transitions. [2020-11-30 00:37:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-30 00:37:12,401 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:12,401 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:12,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-30 00:37:12,402 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1458604050, now seen corresponding path program 1 times [2020-11-30 00:37:12,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:12,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230807568] [2020-11-30 00:37:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-30 00:37:12,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230807568] [2020-11-30 00:37:12,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:12,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:37:12,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972552405] [2020-11-30 00:37:12,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:37:12,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:37:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:12,615 INFO L87 Difference]: Start difference. First operand 5646 states and 6687 transitions. Second operand 5 states. [2020-11-30 00:37:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:13,506 INFO L93 Difference]: Finished difference Result 11000 states and 13056 transitions. [2020-11-30 00:37:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:37:13,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2020-11-30 00:37:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:13,511 INFO L225 Difference]: With dead ends: 11000 [2020-11-30 00:37:13,511 INFO L226 Difference]: Without dead ends: 5694 [2020-11-30 00:37:13,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:37:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2020-11-30 00:37:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5682. [2020-11-30 00:37:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5682 states. [2020-11-30 00:37:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 5682 states and 6723 transitions. [2020-11-30 00:37:14,416 INFO L78 Accepts]: Start accepts. Automaton has 5682 states and 6723 transitions. Word has length 249 [2020-11-30 00:37:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:14,416 INFO L481 AbstractCegarLoop]: Abstraction has 5682 states and 6723 transitions. [2020-11-30 00:37:14,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:37:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5682 states and 6723 transitions. [2020-11-30 00:37:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-30 00:37:14,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:14,423 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:14,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-30 00:37:14,424 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -802969200, now seen corresponding path program 1 times [2020-11-30 00:37:14,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:14,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329851765] [2020-11-30 00:37:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:37:14,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329851765] [2020-11-30 00:37:14,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336033138] [2020-11-30 00:37:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:15,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:37:15,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:37:15,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:37:15,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 00:37:15,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377686911] [2020-11-30 00:37:15,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 00:37:15,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:37:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:37:15,383 INFO L87 Difference]: Start difference. First operand 5682 states and 6723 transitions. Second operand 22 states. [2020-11-30 00:37:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:25,983 INFO L93 Difference]: Finished difference Result 32187 states and 38664 transitions. [2020-11-30 00:37:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2020-11-30 00:37:25,984 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 249 [2020-11-30 00:37:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:26,005 INFO L225 Difference]: With dead ends: 32187 [2020-11-30 00:37:26,005 INFO L226 Difference]: Without dead ends: 27046 [2020-11-30 00:37:26,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3873 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2016, Invalid=9326, Unknown=0, NotChecked=0, Total=11342 [2020-11-30 00:37:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27046 states. [2020-11-30 00:37:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27046 to 5646. [2020-11-30 00:37:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2020-11-30 00:37:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 6687 transitions. [2020-11-30 00:37:27,119 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 6687 transitions. Word has length 249 [2020-11-30 00:37:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:27,120 INFO L481 AbstractCegarLoop]: Abstraction has 5646 states and 6687 transitions. [2020-11-30 00:37:27,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 00:37:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 6687 transitions. [2020-11-30 00:37:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-30 00:37:27,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:27,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:27,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-11-30 00:37:27,339 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash 835322448, now seen corresponding path program 1 times [2020-11-30 00:37:27,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:27,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113719456] [2020-11-30 00:37:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 00:37:27,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113719456] [2020-11-30 00:37:27,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145727431] [2020-11-30 00:37:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:28,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:37:28,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-30 00:37:28,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:37:28,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:37:28,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002479524] [2020-11-30 00:37:28,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:37:28,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:37:28,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:37:28,072 INFO L87 Difference]: Start difference. First operand 5646 states and 6687 transitions. Second operand 4 states. [2020-11-30 00:37:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:29,015 INFO L93 Difference]: Finished difference Result 8815 states and 10439 transitions. [2020-11-30 00:37:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:37:29,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2020-11-30 00:37:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:29,019 INFO L225 Difference]: With dead ends: 8815 [2020-11-30 00:37:29,019 INFO L226 Difference]: Without dead ends: 3487 [2020-11-30 00:37:29,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:37:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2020-11-30 00:37:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2020-11-30 00:37:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3487 states. [2020-11-30 00:37:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 4096 transitions. [2020-11-30 00:37:29,805 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 4096 transitions. Word has length 249 [2020-11-30 00:37:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:29,806 INFO L481 AbstractCegarLoop]: Abstraction has 3487 states and 4096 transitions. [2020-11-30 00:37:29,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:37:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 4096 transitions. [2020-11-30 00:37:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-11-30 00:37:29,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:29,809 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:30,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-11-30 00:37:30,009 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:30,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1191553778, now seen corresponding path program 1 times [2020-11-30 00:37:30,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:30,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985350675] [2020-11-30 00:37:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:37:30,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985350675] [2020-11-30 00:37:30,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:30,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:37:30,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356481517] [2020-11-30 00:37:30,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:37:30,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:37:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:30,150 INFO L87 Difference]: Start difference. First operand 3487 states and 4096 transitions. Second operand 7 states. [2020-11-30 00:37:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:31,603 INFO L93 Difference]: Finished difference Result 7553 states and 8977 transitions. [2020-11-30 00:37:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:37:31,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 251 [2020-11-30 00:37:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:31,607 INFO L225 Difference]: With dead ends: 7553 [2020-11-30 00:37:31,607 INFO L226 Difference]: Without dead ends: 4517 [2020-11-30 00:37:31,609 INFO L677 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 [2020-11-30 00:37:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2020-11-30 00:37:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3471. [2020-11-30 00:37:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2020-11-30 00:37:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4072 transitions. [2020-11-30 00:37:32,388 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4072 transitions. Word has length 251 [2020-11-30 00:37:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:32,388 INFO L481 AbstractCegarLoop]: Abstraction has 3471 states and 4072 transitions. [2020-11-30 00:37:32,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:37:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4072 transitions. [2020-11-30 00:37:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-11-30 00:37:32,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:32,391 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:32,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-30 00:37:32,391 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1957634280, now seen corresponding path program 1 times [2020-11-30 00:37:32,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:32,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194438757] [2020-11-30 00:37:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:37:32,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194438757] [2020-11-30 00:37:32,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:37:32,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:37:32,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811622250] [2020-11-30 00:37:32,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:37:32,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:37:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:37:32,543 INFO L87 Difference]: Start difference. First operand 3471 states and 4072 transitions. Second operand 7 states. [2020-11-30 00:37:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:34,311 INFO L93 Difference]: Finished difference Result 8069 states and 9587 transitions. [2020-11-30 00:37:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:37:34,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 254 [2020-11-30 00:37:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:34,315 INFO L225 Difference]: With dead ends: 8069 [2020-11-30 00:37:34,316 INFO L226 Difference]: Without dead ends: 4957 [2020-11-30 00:37:34,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:37:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2020-11-30 00:37:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 3239. [2020-11-30 00:37:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2020-11-30 00:37:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 3780 transitions. [2020-11-30 00:37:35,108 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 3780 transitions. Word has length 254 [2020-11-30 00:37:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:35,108 INFO L481 AbstractCegarLoop]: Abstraction has 3239 states and 3780 transitions. [2020-11-30 00:37:35,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:37:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 3780 transitions. [2020-11-30 00:37:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-11-30 00:37:35,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:35,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:35,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-30 00:37:35,111 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1210262608, now seen corresponding path program 1 times [2020-11-30 00:37:35,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:35,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886401290] [2020-11-30 00:37:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 00:37:35,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886401290] [2020-11-30 00:37:35,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662419318] [2020-11-30 00:37:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:35,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:37:35,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 00:37:35,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:37:35,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 00:37:35,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176300803] [2020-11-30 00:37:35,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:37:35,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:37:35,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:37:35,794 INFO L87 Difference]: Start difference. First operand 3239 states and 3780 transitions. Second operand 10 states. [2020-11-30 00:37:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:37,306 INFO L93 Difference]: Finished difference Result 7247 states and 8544 transitions. [2020-11-30 00:37:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:37:37,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 255 [2020-11-30 00:37:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:37,310 INFO L225 Difference]: With dead ends: 7247 [2020-11-30 00:37:37,310 INFO L226 Difference]: Without dead ends: 4415 [2020-11-30 00:37:37,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:37:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2020-11-30 00:37:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3239. [2020-11-30 00:37:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2020-11-30 00:37:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 3776 transitions. [2020-11-30 00:37:38,080 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 3776 transitions. Word has length 255 [2020-11-30 00:37:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:38,081 INFO L481 AbstractCegarLoop]: Abstraction has 3239 states and 3776 transitions. [2020-11-30 00:37:38,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:37:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 3776 transitions. [2020-11-30 00:37:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2020-11-30 00:37:38,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:38,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:38,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-11-30 00:37:38,284 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash -289794460, now seen corresponding path program 1 times [2020-11-30 00:37:38,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:38,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476666703] [2020-11-30 00:37:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-30 00:37:38,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476666703] [2020-11-30 00:37:38,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764276045] [2020-11-30 00:37:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:37:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:38,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:37:38,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-30 00:37:38,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:37:38,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 00:37:38,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973286224] [2020-11-30 00:37:38,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:37:38,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:37:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:37:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:37:38,880 INFO L87 Difference]: Start difference. First operand 3239 states and 3776 transitions. Second operand 10 states. [2020-11-30 00:37:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:37:40,743 INFO L93 Difference]: Finished difference Result 8117 states and 9607 transitions. [2020-11-30 00:37:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:37:40,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2020-11-30 00:37:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:37:40,747 INFO L225 Difference]: With dead ends: 8117 [2020-11-30 00:37:40,748 INFO L226 Difference]: Without dead ends: 5285 [2020-11-30 00:37:40,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:37:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2020-11-30 00:37:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 3239. [2020-11-30 00:37:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2020-11-30 00:37:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 3772 transitions. [2020-11-30 00:37:41,625 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 3772 transitions. Word has length 262 [2020-11-30 00:37:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:37:41,625 INFO L481 AbstractCegarLoop]: Abstraction has 3239 states and 3772 transitions. [2020-11-30 00:37:41,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:37:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 3772 transitions. [2020-11-30 00:37:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-11-30 00:37:41,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:41,628 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:41,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2020-11-30 00:37:41,829 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash 277461418, now seen corresponding path program 1 times [2020-11-30 00:37:41,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:41,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163714203] [2020-11-30 00:37:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:41,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:41,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:42,167 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:37:42,168 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:37:42,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-11-30 00:37:42,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:37:42 BoogieIcfgContainer [2020-11-30 00:37:42,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:37:42,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:37:42,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:37:42,522 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:37:42,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:35:15" (3/4) ... [2020-11-30 00:37:42,526 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:37:42,936 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac5319db-1153-4d91-a950-e5f9ee03a9d2/bin/uautomizer/witness.graphml [2020-11-30 00:37:42,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:37:42,939 INFO L168 Benchmark]: Toolchain (without parser) took 150314.16 ms. Allocated memory was 92.3 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 56.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,940 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 92.3 MB. Free memory is still 73.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:37:42,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.92 ms. Allocated memory is still 92.3 MB. Free memory was 56.1 MB in the beginning and 63.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.76 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 57.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,941 INFO L168 Benchmark]: Boogie Preprocessor took 100.24 ms. Allocated memory is still 92.3 MB. Free memory was 57.0 MB in the beginning and 51.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,942 INFO L168 Benchmark]: RCFGBuilder took 2179.98 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 51.6 MB in the beginning and 50.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,942 INFO L168 Benchmark]: TraceAbstraction took 147084.59 ms. Allocated memory was 121.6 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 50.0 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,943 INFO L168 Benchmark]: Witness Printer took 414.78 ms. Allocated memory is still 3.8 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 67.4 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:42,945 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.18 ms. Allocated memory is still 92.3 MB. Free memory is still 73.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 405.92 ms. Allocated memory is still 92.3 MB. Free memory was 56.1 MB in the beginning and 63.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 121.76 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 57.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 100.24 ms. Allocated memory is still 92.3 MB. Free memory was 57.0 MB in the beginning and 51.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2179.98 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 51.6 MB in the beginning and 50.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 147084.59 ms. Allocated memory was 121.6 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 50.0 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 414.78 ms. Allocated memory is still 3.8 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 67.4 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L502] i2 = init() [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] i2 = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L252] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L255] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L258] COND TRUE ! gate3Failed [L259] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L297] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L336] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L523] c1 = check() [L535] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L511] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L410] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] c1 = check() [L535] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L3] __assert_fail("0", "pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c", 3, "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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 558 locations, 37 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 146.6s, OverallIterations: 62, TraceHistogramMax: 3, AutomataDifference: 95.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 32610 SDtfs, 51080 SDslu, 141853 SDs, 0 SdLazy, 27418 SolverSat, 1112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5409 GetRequests, 4322 SyntacticMatches, 4 SemanticMatches, 1083 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29941 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18169occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.0s AutomataMinimizationTime, 61 MinimizatonAttempts, 212224 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 14686 NumberOfCodeBlocks, 14686 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 14327 ConstructedInterpolants, 0 QuantifiedInterpolants, 10182588 SizeOfPredicates, 109 NumberOfNonLiveVariables, 17904 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 81 InterpolantComputations, 48 PerfectInterpolantSequences, 8497/9245 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! Received shutdown request...