./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.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_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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 03e4ea16114e847a6474cef94e9715e022694a81 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 19:43:00,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:43:00,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:43:00,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:43:00,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:43:00,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:43:00,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:43:00,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:43:00,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:43:00,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:43:00,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:43:00,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:43:00,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:43:00,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:43:00,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:43:00,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:43:00,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:43:00,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:43:00,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:43:00,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:43:00,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:43:00,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:43:00,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:43:00,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:43:00,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:43:00,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:43:00,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:43:00,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:43:00,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:43:00,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:43:00,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:43:00,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:43:00,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:43:00,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:43:00,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:43:00,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:43:00,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:43:00,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:43:00,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:43:00,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:43:00,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:43:00,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:43:00,643 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:43:00,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:43:00,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:43:00,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:43:00,645 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:43:00,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:43:00,646 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:43:00,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:43:00,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:43:00,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:43:00,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:43:00,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:43:00,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:43:00,647 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:43:00,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:43:00,648 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:43:00,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:43:00,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:43:00,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:43:00,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:43:00,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:43:00,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:43:00,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:43:00,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:43:00,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:43:00,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:43:00,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:43:00,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:43:00,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:43:00,651 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_1a065378-50fe-4781-b665-c9cfe7a65fd3/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_1a065378-50fe-4781-b665-c9cfe7a65fd3/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 -> 03e4ea16114e847a6474cef94e9715e022694a81 [2020-11-29 19:43:00,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:43:01,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:43:01,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:43:01,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:43:01,040 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:43:01,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2020-11-29 19:43:01,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/data/df941cad9/291358f275d64efba0f129bf08fe1f7e/FLAGfb9badfd5 [2020-11-29 19:43:01,807 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:43:01,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2020-11-29 19:43:01,821 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/data/df941cad9/291358f275d64efba0f129bf08fe1f7e/FLAGfb9badfd5 [2020-11-29 19:43:02,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/data/df941cad9/291358f275d64efba0f129bf08fe1f7e [2020-11-29 19:43:02,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:43:02,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:43:02,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:43:02,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:43:02,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:43:02,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c53c36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02, skipping insertion in model container [2020-11-29 19:43:02,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:43:02,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:43:02,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:43:02,500 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:43:02,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:43:02,589 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:43:02,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02 WrapperNode [2020-11-29 19:43:02,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:43:02,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:43:02,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:43:02,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:43:02,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:43:02,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:43:02,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:43:02,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:43:02,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... [2020-11-29 19:43:02,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:43:02,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:43:02,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:43:02,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:43:02,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:43:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:43:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:43:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:43:05,418 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:43:05,422 INFO L298 CfgBuilder]: Removed 247 assume(true) statements. [2020-11-29 19:43:05,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:43:05 BoogieIcfgContainer [2020-11-29 19:43:05,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:43:05,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:43:05,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:43:05,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:43:05,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:43:02" (1/3) ... [2020-11-29 19:43:05,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bdea6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:43:05, skipping insertion in model container [2020-11-29 19:43:05,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:43:02" (2/3) ... [2020-11-29 19:43:05,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bdea6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:43:05, skipping insertion in model container [2020-11-29 19:43:05,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:43:05" (3/3) ... [2020-11-29 19:43:05,442 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2020-11-29 19:43:05,461 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:43:05,468 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2020-11-29 19:43:05,484 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2020-11-29 19:43:05,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:43:05,547 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:43:05,548 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:43:05,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:43:05,550 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:43:05,551 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:43:05,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:43:05,551 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:43:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states. [2020-11-29 19:43:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 19:43:05,624 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:05,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:43:05,626 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-29 19:43:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:05,632 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2020-11-29 19:43:05,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:05,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642897630] [2020-11-29 19:43:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:05,866 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-29 19:43:05,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642897630] [2020-11-29 19:43:05,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:05,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:05,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373615416] [2020-11-29 19:43:05,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:05,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:05,892 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 3 states. [2020-11-29 19:43:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:06,251 INFO L93 Difference]: Finished difference Result 1278 states and 2088 transitions. [2020-11-29 19:43:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:06,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-29 19:43:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:06,285 INFO L225 Difference]: With dead ends: 1278 [2020-11-29 19:43:06,285 INFO L226 Difference]: Without dead ends: 718 [2020-11-29 19:43:06,302 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-29 19:43:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-11-29 19:43:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 453. [2020-11-29 19:43:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-11-29 19:43:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 707 transitions. [2020-11-29 19:43:06,413 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 707 transitions. Word has length 9 [2020-11-29 19:43:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:06,413 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 707 transitions. [2020-11-29 19:43:06,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions. [2020-11-29 19:43:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 19:43:06,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:06,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:43:06,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:43:06,416 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-29 19:43:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1330220136, now seen corresponding path program 1 times [2020-11-29 19:43:06,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:06,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449381208] [2020-11-29 19:43:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:06,521 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-29 19:43:06,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449381208] [2020-11-29 19:43:06,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:06,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:06,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245281335] [2020-11-29 19:43:06,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:06,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:06,526 INFO L87 Difference]: Start difference. First operand 453 states and 707 transitions. Second operand 3 states. [2020-11-29 19:43:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:06,640 INFO L93 Difference]: Finished difference Result 1119 states and 1731 transitions. [2020-11-29 19:43:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:06,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-29 19:43:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:06,649 INFO L225 Difference]: With dead ends: 1119 [2020-11-29 19:43:06,650 INFO L226 Difference]: Without dead ends: 668 [2020-11-29 19:43:06,652 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-29 19:43:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-11-29 19:43:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 420. [2020-11-29 19:43:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-29 19:43:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 649 transitions. [2020-11-29 19:43:06,709 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 649 transitions. Word has length 10 [2020-11-29 19:43:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:06,711 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 649 transitions. [2020-11-29 19:43:06,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 649 transitions. [2020-11-29 19:43:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 19:43:06,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:06,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:43:06,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:43:06,718 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-29 19:43:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1243418079, now seen corresponding path program 1 times [2020-11-29 19:43:06,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:06,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113513753] [2020-11-29 19:43:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:06,811 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-29 19:43:06,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113513753] [2020-11-29 19:43:06,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:06,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:06,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270280358] [2020-11-29 19:43:06,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:06,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:06,815 INFO L87 Difference]: Start difference. First operand 420 states and 649 transitions. Second operand 3 states. [2020-11-29 19:43:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:06,936 INFO L93 Difference]: Finished difference Result 1238 states and 1918 transitions. [2020-11-29 19:43:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:06,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-29 19:43:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:06,948 INFO L225 Difference]: With dead ends: 1238 [2020-11-29 19:43:06,948 INFO L226 Difference]: Without dead ends: 828 [2020-11-29 19:43:06,951 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-29 19:43:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-11-29 19:43:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 424. [2020-11-29 19:43:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-29 19:43:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 653 transitions. [2020-11-29 19:43:06,983 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 653 transitions. Word has length 14 [2020-11-29 19:43:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:06,983 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 653 transitions. [2020-11-29 19:43:06,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 653 transitions. [2020-11-29 19:43:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 19:43:06,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:06,985 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-29 19:43:06,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:43:06,986 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-29 19:43:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1419090732, now seen corresponding path program 1 times [2020-11-29 19:43:06,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:06,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446894974] [2020-11-29 19:43:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:07,078 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-29 19:43:07,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446894974] [2020-11-29 19:43:07,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:07,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:07,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880769769] [2020-11-29 19:43:07,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:07,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:07,081 INFO L87 Difference]: Start difference. First operand 424 states and 653 transitions. Second operand 4 states. [2020-11-29 19:43:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:07,224 INFO L93 Difference]: Finished difference Result 1559 states and 2382 transitions. [2020-11-29 19:43:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:07,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-29 19:43:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:07,234 INFO L225 Difference]: With dead ends: 1559 [2020-11-29 19:43:07,234 INFO L226 Difference]: Without dead ends: 1149 [2020-11-29 19:43:07,236 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-29 19:43:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2020-11-29 19:43:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 426. [2020-11-29 19:43:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-11-29 19:43:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 655 transitions. [2020-11-29 19:43:07,262 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 655 transitions. Word has length 18 [2020-11-29 19:43:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:07,263 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 655 transitions. [2020-11-29 19:43:07,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 655 transitions. [2020-11-29 19:43:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 19:43:07,269 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:07,270 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-29 19:43:07,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:43:07,270 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-29 19:43:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash 703965683, now seen corresponding path program 1 times [2020-11-29 19:43:07,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:07,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811905506] [2020-11-29 19:43:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:07,401 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-29 19:43:07,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811905506] [2020-11-29 19:43:07,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:07,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:07,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522057540] [2020-11-29 19:43:07,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:07,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:07,404 INFO L87 Difference]: Start difference. First operand 426 states and 655 transitions. Second operand 4 states. [2020-11-29 19:43:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:07,485 INFO L93 Difference]: Finished difference Result 901 states and 1374 transitions. [2020-11-29 19:43:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:07,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-29 19:43:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:07,491 INFO L225 Difference]: With dead ends: 901 [2020-11-29 19:43:07,491 INFO L226 Difference]: Without dead ends: 660 [2020-11-29 19:43:07,492 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-29 19:43:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-11-29 19:43:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 424. [2020-11-29 19:43:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-29 19:43:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 648 transitions. [2020-11-29 19:43:07,513 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 648 transitions. Word has length 19 [2020-11-29 19:43:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:07,513 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 648 transitions. [2020-11-29 19:43:07,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 648 transitions. [2020-11-29 19:43:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 19:43:07,516 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:07,516 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-29 19:43:07,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:43:07,517 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-29 19:43:07,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 628676147, now seen corresponding path program 1 times [2020-11-29 19:43:07,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:07,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625195293] [2020-11-29 19:43:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:07,605 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-29 19:43:07,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625195293] [2020-11-29 19:43:07,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837804951] [2020-11-29 19:43:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:07,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:43:07,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:07,877 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-29 19:43:07,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:07,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:43:07,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704895850] [2020-11-29 19:43:07,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:43:07,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:43:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:07,880 INFO L87 Difference]: Start difference. First operand 424 states and 648 transitions. Second operand 5 states. [2020-11-29 19:43:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:08,163 INFO L93 Difference]: Finished difference Result 1651 states and 2537 transitions. [2020-11-29 19:43:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:43:08,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-29 19:43:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:08,173 INFO L225 Difference]: With dead ends: 1651 [2020-11-29 19:43:08,173 INFO L226 Difference]: Without dead ends: 1238 [2020-11-29 19:43:08,175 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-29 19:43:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-11-29 19:43:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 570. [2020-11-29 19:43:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-29 19:43:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 898 transitions. [2020-11-29 19:43:08,212 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 898 transitions. Word has length 21 [2020-11-29 19:43:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:08,212 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 898 transitions. [2020-11-29 19:43:08,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:43:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 898 transitions. [2020-11-29 19:43:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 19:43:08,215 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:08,216 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-29 19:43:08,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-29 19:43:08,450 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-29 19:43:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -837838367, now seen corresponding path program 2 times [2020-11-29 19:43:08,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:08,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824861415] [2020-11-29 19:43:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:08,525 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-29 19:43:08,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824861415] [2020-11-29 19:43:08,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:08,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:08,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816153267] [2020-11-29 19:43:08,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:08,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:08,528 INFO L87 Difference]: Start difference. First operand 570 states and 898 transitions. Second operand 3 states. [2020-11-29 19:43:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:08,636 INFO L93 Difference]: Finished difference Result 1296 states and 2021 transitions. [2020-11-29 19:43:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:08,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-29 19:43:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:08,643 INFO L225 Difference]: With dead ends: 1296 [2020-11-29 19:43:08,644 INFO L226 Difference]: Without dead ends: 764 [2020-11-29 19:43:08,646 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-29 19:43:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-11-29 19:43:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 519. [2020-11-29 19:43:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-11-29 19:43:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 804 transitions. [2020-11-29 19:43:08,675 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 804 transitions. Word has length 28 [2020-11-29 19:43:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:08,676 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 804 transitions. [2020-11-29 19:43:08,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 804 transitions. [2020-11-29 19:43:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 19:43:08,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:08,678 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-29 19:43:08,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:43:08,679 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-29 19:43:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1453457771, now seen corresponding path program 1 times [2020-11-29 19:43:08,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:08,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123455044] [2020-11-29 19:43:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:08,770 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-29 19:43:08,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123455044] [2020-11-29 19:43:08,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:08,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:08,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184933594] [2020-11-29 19:43:08,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:08,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:08,772 INFO L87 Difference]: Start difference. First operand 519 states and 804 transitions. Second operand 3 states. [2020-11-29 19:43:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:08,941 INFO L93 Difference]: Finished difference Result 1176 states and 1803 transitions. [2020-11-29 19:43:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:08,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-29 19:43:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:08,950 INFO L225 Difference]: With dead ends: 1176 [2020-11-29 19:43:08,950 INFO L226 Difference]: Without dead ends: 686 [2020-11-29 19:43:08,951 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-29 19:43:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-11-29 19:43:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 453. [2020-11-29 19:43:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-11-29 19:43:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 679 transitions. [2020-11-29 19:43:08,975 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 679 transitions. Word has length 28 [2020-11-29 19:43:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:08,976 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 679 transitions. [2020-11-29 19:43:08,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 679 transitions. [2020-11-29 19:43:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-29 19:43:08,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:08,981 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-29 19:43:08,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:43:08,982 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-29 19:43:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1581264384, now seen corresponding path program 1 times [2020-11-29 19:43:08,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:08,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182059697] [2020-11-29 19:43:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:09,086 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-29 19:43:09,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182059697] [2020-11-29 19:43:09,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:09,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:09,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311569393] [2020-11-29 19:43:09,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:09,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:09,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:09,089 INFO L87 Difference]: Start difference. First operand 453 states and 679 transitions. Second operand 4 states. [2020-11-29 19:43:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:09,205 INFO L93 Difference]: Finished difference Result 1087 states and 1635 transitions. [2020-11-29 19:43:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:43:09,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-29 19:43:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:09,214 INFO L225 Difference]: With dead ends: 1087 [2020-11-29 19:43:09,214 INFO L226 Difference]: Without dead ends: 678 [2020-11-29 19:43:09,216 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-29 19:43:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-11-29 19:43:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 453. [2020-11-29 19:43:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-11-29 19:43:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 677 transitions. [2020-11-29 19:43:09,257 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 677 transitions. Word has length 38 [2020-11-29 19:43:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:09,258 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 677 transitions. [2020-11-29 19:43:09,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 677 transitions. [2020-11-29 19:43:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 19:43:09,259 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:09,262 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-29 19:43:09,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:43:09,263 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-29 19:43:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1902944388, now seen corresponding path program 1 times [2020-11-29 19:43:09,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:09,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253094077] [2020-11-29 19:43:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:09,350 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-29 19:43:09,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253094077] [2020-11-29 19:43:09,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:09,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:09,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364359139] [2020-11-29 19:43:09,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:09,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:09,353 INFO L87 Difference]: Start difference. First operand 453 states and 677 transitions. Second operand 3 states. [2020-11-29 19:43:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:09,438 INFO L93 Difference]: Finished difference Result 1023 states and 1534 transitions. [2020-11-29 19:43:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:09,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-29 19:43:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:09,445 INFO L225 Difference]: With dead ends: 1023 [2020-11-29 19:43:09,445 INFO L226 Difference]: Without dead ends: 633 [2020-11-29 19:43:09,446 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-29 19:43:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-11-29 19:43:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 409. [2020-11-29 19:43:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-11-29 19:43:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 603 transitions. [2020-11-29 19:43:09,468 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 603 transitions. Word has length 50 [2020-11-29 19:43:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:09,471 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 603 transitions. [2020-11-29 19:43:09,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 603 transitions. [2020-11-29 19:43:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:43:09,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:09,473 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-29 19:43:09,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:43:09,474 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-29 19:43:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1215657471, now seen corresponding path program 1 times [2020-11-29 19:43:09,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:09,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957039101] [2020-11-29 19:43:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:09,558 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-29 19:43:09,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957039101] [2020-11-29 19:43:09,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:09,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:09,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768975749] [2020-11-29 19:43:09,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:09,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:09,562 INFO L87 Difference]: Start difference. First operand 409 states and 603 transitions. Second operand 3 states. [2020-11-29 19:43:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:09,687 INFO L93 Difference]: Finished difference Result 857 states and 1263 transitions. [2020-11-29 19:43:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:09,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-29 19:43:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:09,693 INFO L225 Difference]: With dead ends: 857 [2020-11-29 19:43:09,693 INFO L226 Difference]: Without dead ends: 503 [2020-11-29 19:43:09,695 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-29 19:43:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-11-29 19:43:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 365. [2020-11-29 19:43:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-11-29 19:43:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 515 transitions. [2020-11-29 19:43:09,714 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 515 transitions. Word has length 51 [2020-11-29 19:43:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:09,715 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 515 transitions. [2020-11-29 19:43:09,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 515 transitions. [2020-11-29 19:43:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 19:43:09,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:09,717 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-29 19:43:09,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:43:09,718 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-29 19:43:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -64177626, now seen corresponding path program 1 times [2020-11-29 19:43:09,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:09,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092648350] [2020-11-29 19:43:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:09,804 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-29 19:43:09,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092648350] [2020-11-29 19:43:09,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:09,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:09,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476522675] [2020-11-29 19:43:09,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:09,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:09,808 INFO L87 Difference]: Start difference. First operand 365 states and 515 transitions. Second operand 4 states. [2020-11-29 19:43:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:09,884 INFO L93 Difference]: Finished difference Result 865 states and 1242 transitions. [2020-11-29 19:43:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:43:09,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-29 19:43:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:09,891 INFO L225 Difference]: With dead ends: 865 [2020-11-29 19:43:09,891 INFO L226 Difference]: Without dead ends: 572 [2020-11-29 19:43:09,892 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-29 19:43:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-11-29 19:43:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 365. [2020-11-29 19:43:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-11-29 19:43:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 513 transitions. [2020-11-29 19:43:09,910 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 513 transitions. Word has length 62 [2020-11-29 19:43:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:09,912 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 513 transitions. [2020-11-29 19:43:09,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 513 transitions. [2020-11-29 19:43:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-29 19:43:09,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:09,913 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-29 19:43:09,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:43:09,914 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-29 19:43:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 461299335, now seen corresponding path program 1 times [2020-11-29 19:43:09,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:09,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445232501] [2020-11-29 19:43:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-29 19:43:10,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445232501] [2020-11-29 19:43:10,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810804453] [2020-11-29 19:43:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:10,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:43:10,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-29 19:43:10,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:10,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 19:43:10,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004399326] [2020-11-29 19:43:10,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:43:10,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:43:10,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:43:10,287 INFO L87 Difference]: Start difference. First operand 365 states and 513 transitions. Second operand 6 states. [2020-11-29 19:43:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:10,435 INFO L93 Difference]: Finished difference Result 1409 states and 2011 transitions. [2020-11-29 19:43:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:10,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-11-29 19:43:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:10,443 INFO L225 Difference]: With dead ends: 1409 [2020-11-29 19:43:10,443 INFO L226 Difference]: Without dead ends: 1063 [2020-11-29 19:43:10,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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-29 19:43:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-11-29 19:43:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 438. [2020-11-29 19:43:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-11-29 19:43:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 610 transitions. [2020-11-29 19:43:10,471 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 610 transitions. Word has length 76 [2020-11-29 19:43:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:10,471 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 610 transitions. [2020-11-29 19:43:10,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:43:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 610 transitions. [2020-11-29 19:43:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-29 19:43:10,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:10,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:43:10,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-29 19:43:10,694 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-29 19:43:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1414363196, now seen corresponding path program 2 times [2020-11-29 19:43:10,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:10,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060245001] [2020-11-29 19:43:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-29 19:43:10,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060245001] [2020-11-29 19:43:10,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:10,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:10,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932287258] [2020-11-29 19:43:10,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:10,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:10,802 INFO L87 Difference]: Start difference. First operand 438 states and 610 transitions. Second operand 3 states. [2020-11-29 19:43:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:10,886 INFO L93 Difference]: Finished difference Result 853 states and 1232 transitions. [2020-11-29 19:43:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:10,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-11-29 19:43:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:10,892 INFO L225 Difference]: With dead ends: 853 [2020-11-29 19:43:10,892 INFO L226 Difference]: Without dead ends: 557 [2020-11-29 19:43:10,893 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-29 19:43:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-11-29 19:43:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 394. [2020-11-29 19:43:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-11-29 19:43:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 552 transitions. [2020-11-29 19:43:10,916 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 552 transitions. Word has length 103 [2020-11-29 19:43:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:10,916 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 552 transitions. [2020-11-29 19:43:10,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 552 transitions. [2020-11-29 19:43:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-29 19:43:10,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:10,925 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, 1, 1, 1, 1, 1, 1, 1, 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-29 19:43:10,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 19:43:10,926 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-29 19:43:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -262724973, now seen corresponding path program 1 times [2020-11-29 19:43:10,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:10,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695007144] [2020-11-29 19:43:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-29 19:43:11,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695007144] [2020-11-29 19:43:11,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:11,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166663129] [2020-11-29 19:43:11,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:11,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:11,032 INFO L87 Difference]: Start difference. First operand 394 states and 552 transitions. Second operand 3 states. [2020-11-29 19:43:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,083 INFO L93 Difference]: Finished difference Result 566 states and 809 transitions. [2020-11-29 19:43:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:11,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-11-29 19:43:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,087 INFO L225 Difference]: With dead ends: 566 [2020-11-29 19:43:11,087 INFO L226 Difference]: Without dead ends: 310 [2020-11-29 19:43:11,090 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-29 19:43:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-29 19:43:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2020-11-29 19:43:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-11-29 19:43:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2020-11-29 19:43:11,106 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 112 [2020-11-29 19:43:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,106 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2020-11-29 19:43:11,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2020-11-29 19:43:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-29 19:43:11,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:43:11,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 19:43:11,109 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-29 19:43:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1252211039, now seen corresponding path program 1 times [2020-11-29 19:43:11,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866784118] [2020-11-29 19:43:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-29 19:43:11,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866784118] [2020-11-29 19:43:11,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:11,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050991819] [2020-11-29 19:43:11,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:11,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:11,203 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand 4 states. [2020-11-29 19:43:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,255 INFO L93 Difference]: Finished difference Result 481 states and 685 transitions. [2020-11-29 19:43:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:43:11,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-11-29 19:43:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,259 INFO L225 Difference]: With dead ends: 481 [2020-11-29 19:43:11,259 INFO L226 Difference]: Without dead ends: 310 [2020-11-29 19:43:11,260 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-29 19:43:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-29 19:43:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2020-11-29 19:43:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-11-29 19:43:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 426 transitions. [2020-11-29 19:43:11,276 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 426 transitions. Word has length 115 [2020-11-29 19:43:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,277 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 426 transitions. [2020-11-29 19:43:11,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 426 transitions. [2020-11-29 19:43:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-29 19:43:11,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,279 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] [2020-11-29 19:43:11,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 19:43:11,280 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-29 19:43:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 501578938, now seen corresponding path program 1 times [2020-11-29 19:43:11,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136598336] [2020-11-29 19:43:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-29 19:43:11,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136598336] [2020-11-29 19:43:11,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:11,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043437919] [2020-11-29 19:43:11,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:11,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:11,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:11,366 INFO L87 Difference]: Start difference. First operand 310 states and 426 transitions. Second operand 3 states. [2020-11-29 19:43:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,413 INFO L93 Difference]: Finished difference Result 609 states and 879 transitions. [2020-11-29 19:43:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:11,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-11-29 19:43:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,418 INFO L225 Difference]: With dead ends: 609 [2020-11-29 19:43:11,418 INFO L226 Difference]: Without dead ends: 443 [2020-11-29 19:43:11,419 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-29 19:43:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2020-11-29 19:43:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 305. [2020-11-29 19:43:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-11-29 19:43:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 418 transitions. [2020-11-29 19:43:11,437 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 418 transitions. Word has length 126 [2020-11-29 19:43:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,437 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 418 transitions. [2020-11-29 19:43:11,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 418 transitions. [2020-11-29 19:43:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-29 19:43:11,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,440 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] [2020-11-29 19:43:11,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 19:43:11,440 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-29 19:43:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 562455808, now seen corresponding path program 1 times [2020-11-29 19:43:11,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843917095] [2020-11-29 19:43:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-29 19:43:11,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843917095] [2020-11-29 19:43:11,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:11,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565863976] [2020-11-29 19:43:11,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:11,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:11,576 INFO L87 Difference]: Start difference. First operand 305 states and 418 transitions. Second operand 3 states. [2020-11-29 19:43:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,624 INFO L93 Difference]: Finished difference Result 590 states and 850 transitions. [2020-11-29 19:43:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:11,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-11-29 19:43:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,628 INFO L225 Difference]: With dead ends: 590 [2020-11-29 19:43:11,629 INFO L226 Difference]: Without dead ends: 429 [2020-11-29 19:43:11,630 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-29 19:43:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-11-29 19:43:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 301. [2020-11-29 19:43:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-11-29 19:43:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2020-11-29 19:43:11,651 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 131 [2020-11-29 19:43:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,652 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2020-11-29 19:43:11,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2020-11-29 19:43:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 19:43:11,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,654 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] [2020-11-29 19:43:11,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 19:43:11,655 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-29 19:43:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 475553694, now seen corresponding path program 1 times [2020-11-29 19:43:11,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537998366] [2020-11-29 19:43:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-29 19:43:11,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537998366] [2020-11-29 19:43:11,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:11,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467527064] [2020-11-29 19:43:11,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:11,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:11,760 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand 3 states. [2020-11-29 19:43:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,803 INFO L93 Difference]: Finished difference Result 456 states and 645 transitions. [2020-11-29 19:43:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:11,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-11-29 19:43:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,807 INFO L225 Difference]: With dead ends: 456 [2020-11-29 19:43:11,807 INFO L226 Difference]: Without dead ends: 299 [2020-11-29 19:43:11,808 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-29 19:43:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-29 19:43:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2020-11-29 19:43:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-11-29 19:43:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 405 transitions. [2020-11-29 19:43:11,825 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 405 transitions. Word has length 137 [2020-11-29 19:43:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,826 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 405 transitions. [2020-11-29 19:43:11,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 405 transitions. [2020-11-29 19:43:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-29 19:43:11,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,828 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] [2020-11-29 19:43:11,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 19:43:11,837 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-29 19:43:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2126572372, now seen corresponding path program 1 times [2020-11-29 19:43:11,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838853680] [2020-11-29 19:43:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-29 19:43:11,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838853680] [2020-11-29 19:43:11,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:11,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:11,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72225299] [2020-11-29 19:43:11,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:11,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:11,940 INFO L87 Difference]: Start difference. First operand 298 states and 405 transitions. Second operand 3 states. [2020-11-29 19:43:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:11,958 INFO L93 Difference]: Finished difference Result 497 states and 702 transitions. [2020-11-29 19:43:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:11,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-11-29 19:43:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:11,962 INFO L225 Difference]: With dead ends: 497 [2020-11-29 19:43:11,962 INFO L226 Difference]: Without dead ends: 343 [2020-11-29 19:43:11,963 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-29 19:43:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-11-29 19:43:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 295. [2020-11-29 19:43:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-29 19:43:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2020-11-29 19:43:11,981 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 401 transitions. Word has length 145 [2020-11-29 19:43:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:11,982 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 401 transitions. [2020-11-29 19:43:11,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 401 transitions. [2020-11-29 19:43:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-29 19:43:11,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:11,984 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] [2020-11-29 19:43:11,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 19:43:11,985 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-29 19:43:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1684690544, now seen corresponding path program 1 times [2020-11-29 19:43:11,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:11,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810394638] [2020-11-29 19:43:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:12,133 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-29 19:43:12,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810394638] [2020-11-29 19:43:12,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:12,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:12,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100277473] [2020-11-29 19:43:12,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:12,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:12,136 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. Second operand 3 states. [2020-11-29 19:43:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:12,176 INFO L93 Difference]: Finished difference Result 476 states and 664 transitions. [2020-11-29 19:43:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:12,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2020-11-29 19:43:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:12,180 INFO L225 Difference]: With dead ends: 476 [2020-11-29 19:43:12,180 INFO L226 Difference]: Without dead ends: 295 [2020-11-29 19:43:12,181 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-29 19:43:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-11-29 19:43:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2020-11-29 19:43:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-29 19:43:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 398 transitions. [2020-11-29 19:43:12,198 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 398 transitions. Word has length 146 [2020-11-29 19:43:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:12,199 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 398 transitions. [2020-11-29 19:43:12,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 398 transitions. [2020-11-29 19:43:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-29 19:43:12,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:12,202 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] [2020-11-29 19:43:12,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 19:43:12,203 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-29 19:43:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1486933092, now seen corresponding path program 1 times [2020-11-29 19:43:12,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:12,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806017994] [2020-11-29 19:43:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:12,397 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-29 19:43:12,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806017994] [2020-11-29 19:43:12,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:12,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:12,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509234198] [2020-11-29 19:43:12,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:12,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:12,401 INFO L87 Difference]: Start difference. First operand 295 states and 398 transitions. Second operand 4 states. [2020-11-29 19:43:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:12,552 INFO L93 Difference]: Finished difference Result 622 states and 881 transitions. [2020-11-29 19:43:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:12,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2020-11-29 19:43:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:12,559 INFO L225 Difference]: With dead ends: 622 [2020-11-29 19:43:12,559 INFO L226 Difference]: Without dead ends: 471 [2020-11-29 19:43:12,560 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-29 19:43:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-11-29 19:43:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 377. [2020-11-29 19:43:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 19:43:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 516 transitions. [2020-11-29 19:43:12,588 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 516 transitions. Word has length 158 [2020-11-29 19:43:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:12,588 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 516 transitions. [2020-11-29 19:43:12,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 516 transitions. [2020-11-29 19:43:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 19:43:12,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:12,592 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-29 19:43:12,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 19:43:12,592 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-29 19:43:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash -268212701, now seen corresponding path program 1 times [2020-11-29 19:43:12,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:12,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365226003] [2020-11-29 19:43:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:12,755 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-29 19:43:12,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365226003] [2020-11-29 19:43:12,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:12,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:12,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202576180] [2020-11-29 19:43:12,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:12,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:12,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:12,761 INFO L87 Difference]: Start difference. First operand 377 states and 516 transitions. Second operand 3 states. [2020-11-29 19:43:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:12,825 INFO L93 Difference]: Finished difference Result 780 states and 1112 transitions. [2020-11-29 19:43:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:12,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-11-29 19:43:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:12,831 INFO L225 Difference]: With dead ends: 780 [2020-11-29 19:43:12,831 INFO L226 Difference]: Without dead ends: 585 [2020-11-29 19:43:12,832 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-29 19:43:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-11-29 19:43:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 446. [2020-11-29 19:43:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-11-29 19:43:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 613 transitions. [2020-11-29 19:43:12,879 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 613 transitions. Word has length 177 [2020-11-29 19:43:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:12,879 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 613 transitions. [2020-11-29 19:43:12,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 613 transitions. [2020-11-29 19:43:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 19:43:12,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:12,883 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-29 19:43:12,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 19:43:12,884 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-29 19:43:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 813181482, now seen corresponding path program 1 times [2020-11-29 19:43:12,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:12,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750347080] [2020-11-29 19:43:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:13,017 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-29 19:43:13,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750347080] [2020-11-29 19:43:13,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:13,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:13,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526754045] [2020-11-29 19:43:13,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:13,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:13,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:13,020 INFO L87 Difference]: Start difference. First operand 446 states and 613 transitions. Second operand 3 states. [2020-11-29 19:43:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:13,100 INFO L93 Difference]: Finished difference Result 926 states and 1319 transitions. [2020-11-29 19:43:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:13,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-29 19:43:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:13,106 INFO L225 Difference]: With dead ends: 926 [2020-11-29 19:43:13,106 INFO L226 Difference]: Without dead ends: 689 [2020-11-29 19:43:13,107 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-29 19:43:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2020-11-29 19:43:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 538. [2020-11-29 19:43:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-29 19:43:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 743 transitions. [2020-11-29 19:43:13,172 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 743 transitions. Word has length 178 [2020-11-29 19:43:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:13,172 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 743 transitions. [2020-11-29 19:43:13,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 743 transitions. [2020-11-29 19:43:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 19:43:13,175 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:13,175 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-29 19:43:13,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 19:43:13,176 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-29 19:43:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1033417352, now seen corresponding path program 1 times [2020-11-29 19:43:13,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:13,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255371858] [2020-11-29 19:43:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:13,304 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-29 19:43:13,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255371858] [2020-11-29 19:43:13,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:13,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:13,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131866869] [2020-11-29 19:43:13,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:13,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:13,307 INFO L87 Difference]: Start difference. First operand 538 states and 743 transitions. Second operand 3 states. [2020-11-29 19:43:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:13,394 INFO L93 Difference]: Finished difference Result 1096 states and 1565 transitions. [2020-11-29 19:43:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:13,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-29 19:43:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:13,401 INFO L225 Difference]: With dead ends: 1096 [2020-11-29 19:43:13,402 INFO L226 Difference]: Without dead ends: 797 [2020-11-29 19:43:13,403 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-29 19:43:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-11-29 19:43:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 620. [2020-11-29 19:43:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-11-29 19:43:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 863 transitions. [2020-11-29 19:43:13,456 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 863 transitions. Word has length 179 [2020-11-29 19:43:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:13,457 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 863 transitions. [2020-11-29 19:43:13,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 863 transitions. [2020-11-29 19:43:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 19:43:13,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:43:13,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 19:43:13,462 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-29 19:43:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1456119178, now seen corresponding path program 1 times [2020-11-29 19:43:13,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:13,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978876978] [2020-11-29 19:43:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:13,622 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-29 19:43:13,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978876978] [2020-11-29 19:43:13,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096081215] [2020-11-29 19:43:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:13,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:43:13,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:14,033 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-29 19:43:14,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:43:14,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-29 19:43:14,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109230327] [2020-11-29 19:43:14,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:14,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:14,036 INFO L87 Difference]: Start difference. First operand 620 states and 863 transitions. Second operand 3 states. [2020-11-29 19:43:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:14,197 INFO L93 Difference]: Finished difference Result 1248 states and 1731 transitions. [2020-11-29 19:43:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:14,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-29 19:43:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:14,205 INFO L225 Difference]: With dead ends: 1248 [2020-11-29 19:43:14,205 INFO L226 Difference]: Without dead ends: 875 [2020-11-29 19:43:14,207 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-29 19:43:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-11-29 19:43:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 620. [2020-11-29 19:43:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-11-29 19:43:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 854 transitions. [2020-11-29 19:43:14,263 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 854 transitions. Word has length 179 [2020-11-29 19:43:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:14,264 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 854 transitions. [2020-11-29 19:43:14,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 854 transitions. [2020-11-29 19:43:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-29 19:43:14,268 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:14,268 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-29 19:43:14,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-29 19:43:14,493 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-29 19:43:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash -608275309, now seen corresponding path program 1 times [2020-11-29 19:43:14,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:14,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834971879] [2020-11-29 19:43:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:14,677 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-29 19:43:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834971879] [2020-11-29 19:43:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062534996] [2020-11-29 19:43:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:14,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:43:14,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:15,006 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-29 19:43:15,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:43:15,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-29 19:43:15,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884945668] [2020-11-29 19:43:15,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:15,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:15,009 INFO L87 Difference]: Start difference. First operand 620 states and 854 transitions. Second operand 3 states. [2020-11-29 19:43:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:15,177 INFO L93 Difference]: Finished difference Result 1457 states and 2044 transitions. [2020-11-29 19:43:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:15,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-29 19:43:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:15,185 INFO L225 Difference]: With dead ends: 1457 [2020-11-29 19:43:15,186 INFO L226 Difference]: Without dead ends: 1084 [2020-11-29 19:43:15,187 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-29 19:43:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-11-29 19:43:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 620. [2020-11-29 19:43:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-11-29 19:43:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 853 transitions. [2020-11-29 19:43:15,250 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 853 transitions. Word has length 180 [2020-11-29 19:43:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:15,250 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 853 transitions. [2020-11-29 19:43:15,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 853 transitions. [2020-11-29 19:43:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-29 19:43:15,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:15,254 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-29 19:43:15,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:43:15,478 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-29 19:43:15,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:15,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2109523564, now seen corresponding path program 1 times [2020-11-29 19:43:15,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:15,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821686492] [2020-11-29 19:43:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:15,718 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-29 19:43:15,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821686492] [2020-11-29 19:43:15,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:15,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:15,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969816216] [2020-11-29 19:43:15,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:15,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:15,721 INFO L87 Difference]: Start difference. First operand 620 states and 853 transitions. Second operand 4 states. [2020-11-29 19:43:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:15,962 INFO L93 Difference]: Finished difference Result 1308 states and 1826 transitions. [2020-11-29 19:43:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:15,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-11-29 19:43:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:15,970 INFO L225 Difference]: With dead ends: 1308 [2020-11-29 19:43:15,970 INFO L226 Difference]: Without dead ends: 935 [2020-11-29 19:43:15,971 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-29 19:43:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-11-29 19:43:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 628. [2020-11-29 19:43:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-29 19:43:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 861 transitions. [2020-11-29 19:43:16,036 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 861 transitions. Word has length 181 [2020-11-29 19:43:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:16,037 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 861 transitions. [2020-11-29 19:43:16,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 861 transitions. [2020-11-29 19:43:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-29 19:43:16,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:16,040 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-29 19:43:16,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 19:43:16,041 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-29 19:43:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 723320170, now seen corresponding path program 1 times [2020-11-29 19:43:16,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:16,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431201607] [2020-11-29 19:43:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:16,204 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-29 19:43:16,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431201607] [2020-11-29 19:43:16,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:16,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:16,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817668631] [2020-11-29 19:43:16,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:16,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:16,210 INFO L87 Difference]: Start difference. First operand 628 states and 861 transitions. Second operand 3 states. [2020-11-29 19:43:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:16,271 INFO L93 Difference]: Finished difference Result 1003 states and 1406 transitions. [2020-11-29 19:43:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:16,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-11-29 19:43:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:16,277 INFO L225 Difference]: With dead ends: 1003 [2020-11-29 19:43:16,277 INFO L226 Difference]: Without dead ends: 609 [2020-11-29 19:43:16,279 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-29 19:43:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-11-29 19:43:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2020-11-29 19:43:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2020-11-29 19:43:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 827 transitions. [2020-11-29 19:43:16,336 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 827 transitions. Word has length 181 [2020-11-29 19:43:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:16,337 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 827 transitions. [2020-11-29 19:43:16,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 827 transitions. [2020-11-29 19:43:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-29 19:43:16,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:16,341 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-29 19:43:16,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 19:43:16,342 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-29 19:43:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1636574752, now seen corresponding path program 1 times [2020-11-29 19:43:16,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:16,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572554630] [2020-11-29 19:43:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:16,508 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-29 19:43:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572554630] [2020-11-29 19:43:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103305602] [2020-11-29 19:43:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:16,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:43:16,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:16,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:43:16,886 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-29 19:43:16,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:43:16,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-11-29 19:43:16,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818933690] [2020-11-29 19:43:16,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:16,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:43:16,889 INFO L87 Difference]: Start difference. First operand 609 states and 827 transitions. Second operand 4 states. [2020-11-29 19:43:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:17,068 INFO L93 Difference]: Finished difference Result 991 states and 1365 transitions. [2020-11-29 19:43:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:17,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-11-29 19:43:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:17,077 INFO L225 Difference]: With dead ends: 991 [2020-11-29 19:43:17,077 INFO L226 Difference]: Without dead ends: 989 [2020-11-29 19:43:17,079 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-29 19:43:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2020-11-29 19:43:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 611. [2020-11-29 19:43:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-11-29 19:43:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 829 transitions. [2020-11-29 19:43:17,157 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 829 transitions. Word has length 181 [2020-11-29 19:43:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:17,157 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 829 transitions. [2020-11-29 19:43:17,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 829 transitions. [2020-11-29 19:43:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-29 19:43:17,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:17,162 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-29 19:43:17,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:43:17,390 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-29 19:43:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash -977354645, now seen corresponding path program 1 times [2020-11-29 19:43:17,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:17,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972917173] [2020-11-29 19:43:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-29 19:43:17,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972917173] [2020-11-29 19:43:17,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:17,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:43:17,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300954026] [2020-11-29 19:43:17,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:43:17,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:43:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:43:17,709 INFO L87 Difference]: Start difference. First operand 611 states and 829 transitions. Second operand 9 states. [2020-11-29 19:43:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:18,475 INFO L93 Difference]: Finished difference Result 2598 states and 3613 transitions. [2020-11-29 19:43:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:43:18,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2020-11-29 19:43:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:18,491 INFO L225 Difference]: With dead ends: 2598 [2020-11-29 19:43:18,492 INFO L226 Difference]: Without dead ends: 2237 [2020-11-29 19:43:18,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:43:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2020-11-29 19:43:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 826. [2020-11-29 19:43:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2020-11-29 19:43:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1104 transitions. [2020-11-29 19:43:18,597 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1104 transitions. Word has length 184 [2020-11-29 19:43:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:18,597 INFO L481 AbstractCegarLoop]: Abstraction has 826 states and 1104 transitions. [2020-11-29 19:43:18,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:43:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1104 transitions. [2020-11-29 19:43:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-29 19:43:18,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:18,602 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-29 19:43:18,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 19:43:18,603 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-29 19:43:18,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:18,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2037748973, now seen corresponding path program 1 times [2020-11-29 19:43:18,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:18,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578568674] [2020-11-29 19:43:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:18,717 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-29 19:43:18,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578568674] [2020-11-29 19:43:18,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:18,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:18,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507571777] [2020-11-29 19:43:18,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:18,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:18,721 INFO L87 Difference]: Start difference. First operand 826 states and 1104 transitions. Second operand 3 states. [2020-11-29 19:43:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:18,973 INFO L93 Difference]: Finished difference Result 1829 states and 2479 transitions. [2020-11-29 19:43:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:18,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-11-29 19:43:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:18,984 INFO L225 Difference]: With dead ends: 1829 [2020-11-29 19:43:18,985 INFO L226 Difference]: Without dead ends: 1468 [2020-11-29 19:43:18,988 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-29 19:43:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-11-29 19:43:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 826. [2020-11-29 19:43:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2020-11-29 19:43:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1102 transitions. [2020-11-29 19:43:19,089 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1102 transitions. Word has length 184 [2020-11-29 19:43:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:19,090 INFO L481 AbstractCegarLoop]: Abstraction has 826 states and 1102 transitions. [2020-11-29 19:43:19,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1102 transitions. [2020-11-29 19:43:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-11-29 19:43:19,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:19,094 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-29 19:43:19,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 19:43:19,095 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-29 19:43:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1044960371, now seen corresponding path program 1 times [2020-11-29 19:43:19,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:19,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448280560] [2020-11-29 19:43:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:19,193 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-29 19:43:19,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448280560] [2020-11-29 19:43:19,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:19,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:19,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743210578] [2020-11-29 19:43:19,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:19,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:19,196 INFO L87 Difference]: Start difference. First operand 826 states and 1102 transitions. Second operand 3 states. [2020-11-29 19:43:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:19,347 INFO L93 Difference]: Finished difference Result 1377 states and 1850 transitions. [2020-11-29 19:43:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:19,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2020-11-29 19:43:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:19,352 INFO L225 Difference]: With dead ends: 1377 [2020-11-29 19:43:19,353 INFO L226 Difference]: Without dead ends: 672 [2020-11-29 19:43:19,355 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-29 19:43:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-11-29 19:43:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 671. [2020-11-29 19:43:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-11-29 19:43:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 874 transitions. [2020-11-29 19:43:19,428 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 874 transitions. Word has length 187 [2020-11-29 19:43:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:19,428 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 874 transitions. [2020-11-29 19:43:19,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 874 transitions. [2020-11-29 19:43:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 19:43:19,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:19,432 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-29 19:43:19,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-29 19:43:19,433 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-29 19:43:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1112078537, now seen corresponding path program 1 times [2020-11-29 19:43:19,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:19,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135048296] [2020-11-29 19:43:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:19,716 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-29 19:43:19,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135048296] [2020-11-29 19:43:19,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:19,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:43:19,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039081087] [2020-11-29 19:43:19,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:43:19,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:43:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:43:19,719 INFO L87 Difference]: Start difference. First operand 671 states and 874 transitions. Second operand 9 states. [2020-11-29 19:43:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:21,317 INFO L93 Difference]: Finished difference Result 1901 states and 2564 transitions. [2020-11-29 19:43:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 19:43:21,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2020-11-29 19:43:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:21,340 INFO L225 Difference]: With dead ends: 1901 [2020-11-29 19:43:21,341 INFO L226 Difference]: Without dead ends: 1551 [2020-11-29 19:43:21,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2020-11-29 19:43:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2020-11-29 19:43:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 775. [2020-11-29 19:43:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-11-29 19:43:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1004 transitions. [2020-11-29 19:43:21,431 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1004 transitions. Word has length 192 [2020-11-29 19:43:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:21,432 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1004 transitions. [2020-11-29 19:43:21,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:43:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1004 transitions. [2020-11-29 19:43:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-29 19:43:21,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:21,436 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-29 19:43:21,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 19:43:21,437 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-29 19:43:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1558494383, now seen corresponding path program 1 times [2020-11-29 19:43:21,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:21,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329509054] [2020-11-29 19:43:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:21,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-29 19:43:21,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329509054] [2020-11-29 19:43:21,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:21,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:43:21,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299521091] [2020-11-29 19:43:21,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:43:21,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:43:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:43:21,555 INFO L87 Difference]: Start difference. First operand 775 states and 1004 transitions. Second operand 3 states. [2020-11-29 19:43:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:21,711 INFO L93 Difference]: Finished difference Result 1507 states and 1946 transitions. [2020-11-29 19:43:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:43:21,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2020-11-29 19:43:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:21,724 INFO L225 Difference]: With dead ends: 1507 [2020-11-29 19:43:21,724 INFO L226 Difference]: Without dead ends: 1016 [2020-11-29 19:43:21,726 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-29 19:43:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2020-11-29 19:43:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 775. [2020-11-29 19:43:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-11-29 19:43:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 986 transitions. [2020-11-29 19:43:21,810 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 986 transitions. Word has length 198 [2020-11-29 19:43:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:21,810 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 986 transitions. [2020-11-29 19:43:21,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:43:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 986 transitions. [2020-11-29 19:43:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-29 19:43:21,814 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:21,815 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-29 19:43:21,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 19:43:21,815 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-29 19:43:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1350269519, now seen corresponding path program 1 times [2020-11-29 19:43:21,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:21,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69250556] [2020-11-29 19:43:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:22,003 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-29 19:43:22,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69250556] [2020-11-29 19:43:22,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:22,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:43:22,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473422959] [2020-11-29 19:43:22,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:43:22,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:43:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:43:22,006 INFO L87 Difference]: Start difference. First operand 775 states and 986 transitions. Second operand 6 states. [2020-11-29 19:43:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:22,344 INFO L93 Difference]: Finished difference Result 2497 states and 3299 transitions. [2020-11-29 19:43:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:43:22,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2020-11-29 19:43:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:22,352 INFO L225 Difference]: With dead ends: 2497 [2020-11-29 19:43:22,352 INFO L226 Difference]: Without dead ends: 2037 [2020-11-29 19:43:22,354 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-29 19:43:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2020-11-29 19:43:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 852. [2020-11-29 19:43:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-29 19:43:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1084 transitions. [2020-11-29 19:43:22,478 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1084 transitions. Word has length 198 [2020-11-29 19:43:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:22,478 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1084 transitions. [2020-11-29 19:43:22,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:43:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1084 transitions. [2020-11-29 19:43:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-29 19:43:22,482 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:22,483 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-29 19:43:22,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 19:43:22,483 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-29 19:43:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2108592399, now seen corresponding path program 1 times [2020-11-29 19:43:22,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:22,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286815431] [2020-11-29 19:43:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:22,763 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-29 19:43:22,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286815431] [2020-11-29 19:43:22,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:22,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 19:43:22,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587573890] [2020-11-29 19:43:22,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:43:22,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:43:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:43:22,766 INFO L87 Difference]: Start difference. First operand 852 states and 1084 transitions. Second operand 10 states. [2020-11-29 19:43:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:25,402 INFO L93 Difference]: Finished difference Result 3918 states and 5038 transitions. [2020-11-29 19:43:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 19:43:25,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2020-11-29 19:43:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:25,416 INFO L225 Difference]: With dead ends: 3918 [2020-11-29 19:43:25,417 INFO L226 Difference]: Without dead ends: 3384 [2020-11-29 19:43:25,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 19:43:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2020-11-29 19:43:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 1066. [2020-11-29 19:43:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-11-29 19:43:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1327 transitions. [2020-11-29 19:43:25,604 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1327 transitions. Word has length 198 [2020-11-29 19:43:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:25,604 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1327 transitions. [2020-11-29 19:43:25,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:43:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1327 transitions. [2020-11-29 19:43:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-29 19:43:25,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:25,609 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-29 19:43:25,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 19:43:25,610 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-29 19:43:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:25,611 INFO L82 PathProgramCache]: Analyzing trace with hash 386459467, now seen corresponding path program 1 times [2020-11-29 19:43:25,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:25,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906271053] [2020-11-29 19:43:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:25,867 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-29 19:43:25,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906271053] [2020-11-29 19:43:25,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:25,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 19:43:25,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116177321] [2020-11-29 19:43:25,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:43:25,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:43:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:43:25,869 INFO L87 Difference]: Start difference. First operand 1066 states and 1327 transitions. Second operand 9 states. [2020-11-29 19:43:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:27,144 INFO L93 Difference]: Finished difference Result 3167 states and 4001 transitions. [2020-11-29 19:43:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-29 19:43:27,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2020-11-29 19:43:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:27,151 INFO L225 Difference]: With dead ends: 3167 [2020-11-29 19:43:27,151 INFO L226 Difference]: Without dead ends: 2414 [2020-11-29 19:43:27,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-11-29 19:43:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2020-11-29 19:43:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1154. [2020-11-29 19:43:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2020-11-29 19:43:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1422 transitions. [2020-11-29 19:43:27,308 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1422 transitions. Word has length 198 [2020-11-29 19:43:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:27,308 INFO L481 AbstractCegarLoop]: Abstraction has 1154 states and 1422 transitions. [2020-11-29 19:43:27,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:43:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1422 transitions. [2020-11-29 19:43:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-29 19:43:27,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:27,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, 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] [2020-11-29 19:43:27,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-29 19:43:27,312 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-29 19:43:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1971144446, now seen corresponding path program 1 times [2020-11-29 19:43:27,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:27,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462179438] [2020-11-29 19:43:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-11-29 19:43:27,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462179438] [2020-11-29 19:43:27,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:27,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:27,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094862822] [2020-11-29 19:43:27,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:43:27,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:43:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:43:27,450 INFO L87 Difference]: Start difference. First operand 1154 states and 1422 transitions. Second operand 4 states. [2020-11-29 19:43:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:27,810 INFO L93 Difference]: Finished difference Result 2114 states and 2637 transitions. [2020-11-29 19:43:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:27,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2020-11-29 19:43:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:27,816 INFO L225 Difference]: With dead ends: 2114 [2020-11-29 19:43:27,816 INFO L226 Difference]: Without dead ends: 1268 [2020-11-29 19:43:27,818 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-29 19:43:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2020-11-29 19:43:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 942. [2020-11-29 19:43:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2020-11-29 19:43:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1146 transitions. [2020-11-29 19:43:28,023 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1146 transitions. Word has length 207 [2020-11-29 19:43:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:28,024 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 1146 transitions. [2020-11-29 19:43:28,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:43:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1146 transitions. [2020-11-29 19:43:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-29 19:43:28,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:28,028 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] [2020-11-29 19:43:28,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 19:43:28,028 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-29 19:43:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash 679217551, now seen corresponding path program 1 times [2020-11-29 19:43:28,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:28,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441966236] [2020-11-29 19:43:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:28,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441966236] [2020-11-29 19:43:28,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793907808] [2020-11-29 19:43:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:28,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:43:28,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-29 19:43:28,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:43:28,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2020-11-29 19:43:28,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231447313] [2020-11-29 19:43:28,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:43:28,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:43:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-11-29 19:43:28,878 INFO L87 Difference]: Start difference. First operand 942 states and 1146 transitions. Second operand 7 states. [2020-11-29 19:43:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:29,766 INFO L93 Difference]: Finished difference Result 2644 states and 3257 transitions. [2020-11-29 19:43:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 19:43:29,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2020-11-29 19:43:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:29,772 INFO L225 Difference]: With dead ends: 2644 [2020-11-29 19:43:29,772 INFO L226 Difference]: Without dead ends: 2028 [2020-11-29 19:43:29,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2020-11-29 19:43:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2020-11-29 19:43:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 985. [2020-11-29 19:43:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2020-11-29 19:43:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1196 transitions. [2020-11-29 19:43:29,903 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1196 transitions. Word has length 233 [2020-11-29 19:43:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:29,903 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1196 transitions. [2020-11-29 19:43:29,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:43:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1196 transitions. [2020-11-29 19:43:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-29 19:43:29,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:29,907 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] [2020-11-29 19:43:30,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-11-29 19:43:30,134 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-29 19:43:30,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash 656585297, now seen corresponding path program 1 times [2020-11-29 19:43:30,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:30,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985724135] [2020-11-29 19:43:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:30,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985724135] [2020-11-29 19:43:30,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112582384] [2020-11-29 19:43:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:30,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:43:30,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:31,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:31,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-29 19:43:31,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229099598] [2020-11-29 19:43:31,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:43:31,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:43:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:43:31,029 INFO L87 Difference]: Start difference. First operand 985 states and 1196 transitions. Second operand 12 states. [2020-11-29 19:43:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:32,492 INFO L93 Difference]: Finished difference Result 4787 states and 5981 transitions. [2020-11-29 19:43:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 19:43:32,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 233 [2020-11-29 19:43:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:32,498 INFO L225 Difference]: With dead ends: 4787 [2020-11-29 19:43:32,498 INFO L226 Difference]: Without dead ends: 4128 [2020-11-29 19:43:32,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 19:43:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2020-11-29 19:43:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 1817. [2020-11-29 19:43:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2020-11-29 19:43:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2239 transitions. [2020-11-29 19:43:32,751 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2239 transitions. Word has length 233 [2020-11-29 19:43:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:32,752 INFO L481 AbstractCegarLoop]: Abstraction has 1817 states and 2239 transitions. [2020-11-29 19:43:32,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:43:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2239 transitions. [2020-11-29 19:43:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-29 19:43:32,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:32,758 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] [2020-11-29 19:43:32,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:43:32,986 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-29 19:43:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -400145905, now seen corresponding path program 1 times [2020-11-29 19:43:32,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:32,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015431119] [2020-11-29 19:43:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-11-29 19:43:33,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015431119] [2020-11-29 19:43:33,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:33,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:33,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351994716] [2020-11-29 19:43:33,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:43:33,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:43:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:33,251 INFO L87 Difference]: Start difference. First operand 1817 states and 2239 transitions. Second operand 5 states. [2020-11-29 19:43:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:33,566 INFO L93 Difference]: Finished difference Result 3306 states and 4085 transitions. [2020-11-29 19:43:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:33,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2020-11-29 19:43:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:33,571 INFO L225 Difference]: With dead ends: 3306 [2020-11-29 19:43:33,571 INFO L226 Difference]: Without dead ends: 1817 [2020-11-29 19:43:33,574 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-29 19:43:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2020-11-29 19:43:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2020-11-29 19:43:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2020-11-29 19:43:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2236 transitions. [2020-11-29 19:43:33,897 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2236 transitions. Word has length 233 [2020-11-29 19:43:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:33,898 INFO L481 AbstractCegarLoop]: Abstraction has 1817 states and 2236 transitions. [2020-11-29 19:43:33,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:43:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2236 transitions. [2020-11-29 19:43:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-29 19:43:33,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:33,903 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] [2020-11-29 19:43:33,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-29 19:43:33,904 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-29 19:43:33,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1707883426, now seen corresponding path program 1 times [2020-11-29 19:43:33,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:33,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601225586] [2020-11-29 19:43:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:34,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601225586] [2020-11-29 19:43:34,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381664966] [2020-11-29 19:43:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:34,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:43:34,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:34,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:34,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-29 19:43:34,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978013014] [2020-11-29 19:43:34,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:43:34,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:43:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:43:34,916 INFO L87 Difference]: Start difference. First operand 1817 states and 2236 transitions. Second operand 16 states. [2020-11-29 19:43:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:39,267 INFO L93 Difference]: Finished difference Result 14723 states and 18637 transitions. [2020-11-29 19:43:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-11-29 19:43:39,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 234 [2020-11-29 19:43:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:39,308 INFO L225 Difference]: With dead ends: 14723 [2020-11-29 19:43:39,308 INFO L226 Difference]: Without dead ends: 13352 [2020-11-29 19:43:39,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1200, Invalid=4202, Unknown=0, NotChecked=0, Total=5402 [2020-11-29 19:43:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13352 states. [2020-11-29 19:43:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13352 to 2676. [2020-11-29 19:43:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2020-11-29 19:43:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3315 transitions. [2020-11-29 19:43:39,867 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3315 transitions. Word has length 234 [2020-11-29 19:43:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:39,867 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3315 transitions. [2020-11-29 19:43:39,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:43:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3315 transitions. [2020-11-29 19:43:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-29 19:43:39,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:39,875 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] [2020-11-29 19:43:40,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2020-11-29 19:43:40,076 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-29 19:43:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash -232698588, now seen corresponding path program 1 times [2020-11-29 19:43:40,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:40,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171908294] [2020-11-29 19:43:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:40,356 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-29 19:43:40,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171908294] [2020-11-29 19:43:40,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:40,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:40,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034946741] [2020-11-29 19:43:40,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:43:40,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:43:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:40,359 INFO L87 Difference]: Start difference. First operand 2676 states and 3315 transitions. Second operand 5 states. [2020-11-29 19:43:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:40,855 INFO L93 Difference]: Finished difference Result 4992 states and 6197 transitions. [2020-11-29 19:43:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:40,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2020-11-29 19:43:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:40,863 INFO L225 Difference]: With dead ends: 4992 [2020-11-29 19:43:40,863 INFO L226 Difference]: Without dead ends: 2688 [2020-11-29 19:43:40,866 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-29 19:43:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2020-11-29 19:43:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2684. [2020-11-29 19:43:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-11-29 19:43:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3315 transitions. [2020-11-29 19:43:41,359 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3315 transitions. Word has length 234 [2020-11-29 19:43:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:41,360 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 3315 transitions. [2020-11-29 19:43:41,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:43:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3315 transitions. [2020-11-29 19:43:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-29 19:43:41,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:41,368 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] [2020-11-29 19:43:41,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-29 19:43:41,369 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-29 19:43:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 199220383, now seen corresponding path program 1 times [2020-11-29 19:43:41,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:41,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105403871] [2020-11-29 19:43:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:41,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105403871] [2020-11-29 19:43:41,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527518611] [2020-11-29 19:43:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:42,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:43:42,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:42,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:42,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-29 19:43:42,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484559833] [2020-11-29 19:43:42,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:43:42,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:43:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:43:42,226 INFO L87 Difference]: Start difference. First operand 2684 states and 3315 transitions. Second operand 12 states. [2020-11-29 19:43:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:45,303 INFO L93 Difference]: Finished difference Result 13151 states and 16640 transitions. [2020-11-29 19:43:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 19:43:45,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 234 [2020-11-29 19:43:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:45,326 INFO L225 Difference]: With dead ends: 13151 [2020-11-29 19:43:45,326 INFO L226 Difference]: Without dead ends: 11025 [2020-11-29 19:43:45,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 19:43:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11025 states. [2020-11-29 19:43:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11025 to 2692. [2020-11-29 19:43:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2020-11-29 19:43:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3327 transitions. [2020-11-29 19:43:45,799 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3327 transitions. Word has length 234 [2020-11-29 19:43:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:45,799 INFO L481 AbstractCegarLoop]: Abstraction has 2692 states and 3327 transitions. [2020-11-29 19:43:45,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:43:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3327 transitions. [2020-11-29 19:43:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-29 19:43:45,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:45,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:43:46,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:43:46,034 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-29 19:43:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -857510819, now seen corresponding path program 1 times [2020-11-29 19:43:46,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:46,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103592224] [2020-11-29 19:43:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-11-29 19:43:46,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103592224] [2020-11-29 19:43:46,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:46,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:46,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905058246] [2020-11-29 19:43:46,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:43:46,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:43:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:46,375 INFO L87 Difference]: Start difference. First operand 2692 states and 3327 transitions. Second operand 5 states. [2020-11-29 19:43:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:47,085 INFO L93 Difference]: Finished difference Result 5026 states and 6226 transitions. [2020-11-29 19:43:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:47,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2020-11-29 19:43:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:47,091 INFO L225 Difference]: With dead ends: 5026 [2020-11-29 19:43:47,092 INFO L226 Difference]: Without dead ends: 2696 [2020-11-29 19:43:47,095 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-29 19:43:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2020-11-29 19:43:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2684. [2020-11-29 19:43:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-11-29 19:43:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3315 transitions. [2020-11-29 19:43:47,451 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3315 transitions. Word has length 234 [2020-11-29 19:43:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:47,451 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 3315 transitions. [2020-11-29 19:43:47,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:43:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3315 transitions. [2020-11-29 19:43:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:43:47,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:47,457 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] [2020-11-29 19:43:47,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 19:43:47,458 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-29 19:43:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:47,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1454712530, now seen corresponding path program 1 times [2020-11-29 19:43:47,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:47,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275888098] [2020-11-29 19:43:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:47,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275888098] [2020-11-29 19:43:47,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317921231] [2020-11-29 19:43:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:48,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:43:48,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-29 19:43:48,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:43:48,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2020-11-29 19:43:48,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894070685] [2020-11-29 19:43:48,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:43:48,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:43:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:43:48,248 INFO L87 Difference]: Start difference. First operand 2684 states and 3315 transitions. Second operand 8 states. [2020-11-29 19:43:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:50,360 INFO L93 Difference]: Finished difference Result 9740 states and 12348 transitions. [2020-11-29 19:43:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-29 19:43:50,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2020-11-29 19:43:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:50,369 INFO L225 Difference]: With dead ends: 9740 [2020-11-29 19:43:50,369 INFO L226 Difference]: Without dead ends: 7614 [2020-11-29 19:43:50,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2020-11-29 19:43:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7614 states. [2020-11-29 19:43:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7614 to 2642. [2020-11-29 19:43:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2642 states. [2020-11-29 19:43:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3267 transitions. [2020-11-29 19:43:50,794 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3267 transitions. Word has length 235 [2020-11-29 19:43:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:50,794 INFO L481 AbstractCegarLoop]: Abstraction has 2642 states and 3267 transitions. [2020-11-29 19:43:50,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:43:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3267 transitions. [2020-11-29 19:43:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:43:50,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:50,798 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-29 19:43:50,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:43:50,999 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-29 19:43:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1815351465, now seen corresponding path program 1 times [2020-11-29 19:43:51,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:51,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088782223] [2020-11-29 19:43:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:51,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088782223] [2020-11-29 19:43:51,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421410871] [2020-11-29 19:43:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:43:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:51,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:43:51,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:43:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:43:51,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:43:51,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-29 19:43:51,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602657918] [2020-11-29 19:43:51,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:43:51,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:43:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:43:51,881 INFO L87 Difference]: Start difference. First operand 2642 states and 3267 transitions. Second operand 16 states. [2020-11-29 19:43:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:57,737 INFO L93 Difference]: Finished difference Result 18829 states and 23920 transitions. [2020-11-29 19:43:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-11-29 19:43:57,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2020-11-29 19:43:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:57,750 INFO L225 Difference]: With dead ends: 18829 [2020-11-29 19:43:57,750 INFO L226 Difference]: Without dead ends: 16745 [2020-11-29 19:43:57,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1198, Invalid=4204, Unknown=0, NotChecked=0, Total=5402 [2020-11-29 19:43:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2020-11-29 19:43:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 2658. [2020-11-29 19:43:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2020-11-29 19:43:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3291 transitions. [2020-11-29 19:43:58,272 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3291 transitions. Word has length 235 [2020-11-29 19:43:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:58,273 INFO L481 AbstractCegarLoop]: Abstraction has 2658 states and 3291 transitions. [2020-11-29 19:43:58,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:43:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3291 transitions. [2020-11-29 19:43:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:43:58,278 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:58,279 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-29 19:43:58,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-11-29 19:43:58,497 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-29 19:43:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -125230549, now seen corresponding path program 1 times [2020-11-29 19:43:58,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:58,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104822757] [2020-11-29 19:43:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:43:58,764 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-29 19:43:58,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104822757] [2020-11-29 19:43:58,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:43:58,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:43:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629396387] [2020-11-29 19:43:58,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:43:58,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:43:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:43:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:43:58,766 INFO L87 Difference]: Start difference. First operand 2658 states and 3291 transitions. Second operand 5 states. [2020-11-29 19:43:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:43:59,252 INFO L93 Difference]: Finished difference Result 4958 states and 6151 transitions. [2020-11-29 19:43:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:43:59,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2020-11-29 19:43:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:43:59,255 INFO L225 Difference]: With dead ends: 4958 [2020-11-29 19:43:59,255 INFO L226 Difference]: Without dead ends: 2678 [2020-11-29 19:43:59,258 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-29 19:43:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2020-11-29 19:43:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2642. [2020-11-29 19:43:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2642 states. [2020-11-29 19:43:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3267 transitions. [2020-11-29 19:43:59,670 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3267 transitions. Word has length 235 [2020-11-29 19:43:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:43:59,670 INFO L481 AbstractCegarLoop]: Abstraction has 2642 states and 3267 transitions. [2020-11-29 19:43:59,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:43:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3267 transitions. [2020-11-29 19:43:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:43:59,674 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:43:59,674 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-29 19:43:59,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-29 19:43:59,674 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-29 19:43:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:43:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash 444188252, now seen corresponding path program 1 times [2020-11-29 19:43:59,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:43:59,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691682669] [2020-11-29 19:43:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:43:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:00,070 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-29 19:44:00,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691682669] [2020-11-29 19:44:00,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500584764] [2020-11-29 19:44:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:44:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:00,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:44:00,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:44:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:00,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:44:00,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-29 19:44:00,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281884637] [2020-11-29 19:44:00,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-29 19:44:00,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 19:44:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:44:00,754 INFO L87 Difference]: Start difference. First operand 2642 states and 3267 transitions. Second operand 21 states. [2020-11-29 19:44:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:09,020 INFO L93 Difference]: Finished difference Result 24378 states and 30364 transitions. [2020-11-29 19:44:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-29 19:44:09,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 235 [2020-11-29 19:44:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:09,042 INFO L225 Difference]: With dead ends: 24378 [2020-11-29 19:44:09,042 INFO L226 Difference]: Without dead ends: 22294 [2020-11-29 19:44:09,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3415 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1884, Invalid=8216, Unknown=0, NotChecked=0, Total=10100 [2020-11-29 19:44:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22294 states. [2020-11-29 19:44:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22294 to 3714. [2020-11-29 19:44:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2020-11-29 19:44:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4604 transitions. [2020-11-29 19:44:10,025 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4604 transitions. Word has length 235 [2020-11-29 19:44:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:10,026 INFO L481 AbstractCegarLoop]: Abstraction has 3714 states and 4604 transitions. [2020-11-29 19:44:10,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-29 19:44:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4604 transitions. [2020-11-29 19:44:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:44:10,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:10,032 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-29 19:44:10,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-11-29 19:44:10,233 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-29 19:44:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1974296226, now seen corresponding path program 1 times [2020-11-29 19:44:10,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:10,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145912071] [2020-11-29 19:44:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:44:10,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145912071] [2020-11-29 19:44:10,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:10,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:44:10,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253246176] [2020-11-29 19:44:10,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:44:10,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:44:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:44:10,454 INFO L87 Difference]: Start difference. First operand 3714 states and 4604 transitions. Second operand 5 states. [2020-11-29 19:44:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:11,020 INFO L93 Difference]: Finished difference Result 7053 states and 8758 transitions. [2020-11-29 19:44:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:44:11,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2020-11-29 19:44:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:11,025 INFO L225 Difference]: With dead ends: 7053 [2020-11-29 19:44:11,025 INFO L226 Difference]: Without dead ends: 3774 [2020-11-29 19:44:11,029 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-29 19:44:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2020-11-29 19:44:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3754. [2020-11-29 19:44:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2020-11-29 19:44:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4624 transitions. [2020-11-29 19:44:11,639 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4624 transitions. Word has length 235 [2020-11-29 19:44:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:11,639 INFO L481 AbstractCegarLoop]: Abstraction has 3754 states and 4624 transitions. [2020-11-29 19:44:11,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:44:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4624 transitions. [2020-11-29 19:44:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:44:11,645 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:11,645 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-29 19:44:11,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-29 19:44:11,646 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-29 19:44:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1565230932, now seen corresponding path program 1 times [2020-11-29 19:44:11,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:11,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64375491] [2020-11-29 19:44:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:11,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64375491] [2020-11-29 19:44:11,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137769276] [2020-11-29 19:44:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:44:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:12,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:44:12,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:44:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:12,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:44:12,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-29 19:44:12,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591581622] [2020-11-29 19:44:12,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:44:12,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:44:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:44:12,533 INFO L87 Difference]: Start difference. First operand 3754 states and 4624 transitions. Second operand 12 states. [2020-11-29 19:44:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:17,016 INFO L93 Difference]: Finished difference Result 20081 states and 25177 transitions. [2020-11-29 19:44:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 19:44:17,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 235 [2020-11-29 19:44:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:17,029 INFO L225 Difference]: With dead ends: 20081 [2020-11-29 19:44:17,029 INFO L226 Difference]: Without dead ends: 16983 [2020-11-29 19:44:17,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 19:44:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16983 states. [2020-11-29 19:44:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16983 to 3764. [2020-11-29 19:44:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2020-11-29 19:44:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4639 transitions. [2020-11-29 19:44:17,698 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4639 transitions. Word has length 235 [2020-11-29 19:44:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:17,698 INFO L481 AbstractCegarLoop]: Abstraction has 3764 states and 4639 transitions. [2020-11-29 19:44:17,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:44:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4639 transitions. [2020-11-29 19:44:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:44:17,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:17,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, 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-29 19:44:17,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-11-29 19:44:17,905 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-29 19:44:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1673005162, now seen corresponding path program 1 times [2020-11-29 19:44:17,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:17,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956407862] [2020-11-29 19:44:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-11-29 19:44:18,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956407862] [2020-11-29 19:44:18,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:18,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:44:18,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168228317] [2020-11-29 19:44:18,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:44:18,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:44:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:44:18,151 INFO L87 Difference]: Start difference. First operand 3764 states and 4639 transitions. Second operand 5 states. [2020-11-29 19:44:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:18,912 INFO L93 Difference]: Finished difference Result 7145 states and 8825 transitions. [2020-11-29 19:44:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:44:18,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2020-11-29 19:44:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:18,916 INFO L225 Difference]: With dead ends: 7145 [2020-11-29 19:44:18,916 INFO L226 Difference]: Without dead ends: 3769 [2020-11-29 19:44:18,919 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-29 19:44:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2020-11-29 19:44:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3754. [2020-11-29 19:44:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2020-11-29 19:44:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4624 transitions. [2020-11-29 19:44:19,696 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4624 transitions. Word has length 235 [2020-11-29 19:44:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:19,697 INFO L481 AbstractCegarLoop]: Abstraction has 3754 states and 4624 transitions. [2020-11-29 19:44:19,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:44:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4624 transitions. [2020-11-29 19:44:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 19:44:19,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:19,703 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-29 19:44:19,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-29 19:44:19,703 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-29 19:44:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 823333098, now seen corresponding path program 1 times [2020-11-29 19:44:19,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:19,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371857722] [2020-11-29 19:44:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-11-29 19:44:19,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371857722] [2020-11-29 19:44:19,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:19,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:44:19,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916880682] [2020-11-29 19:44:19,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:44:19,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:44:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:44:19,833 INFO L87 Difference]: Start difference. First operand 3754 states and 4624 transitions. Second operand 3 states. [2020-11-29 19:44:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:20,506 INFO L93 Difference]: Finished difference Result 6379 states and 7810 transitions. [2020-11-29 19:44:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:44:20,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2020-11-29 19:44:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:20,509 INFO L225 Difference]: With dead ends: 6379 [2020-11-29 19:44:20,509 INFO L226 Difference]: Without dead ends: 3005 [2020-11-29 19:44:20,513 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-29 19:44:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-11-29 19:44:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2020-11-29 19:44:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2020-11-29 19:44:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3629 transitions. [2020-11-29 19:44:20,994 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3629 transitions. Word has length 235 [2020-11-29 19:44:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:20,994 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3629 transitions. [2020-11-29 19:44:20,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:44:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3629 transitions. [2020-11-29 19:44:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 19:44:20,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:20,999 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-29 19:44:20,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-29 19:44:20,999 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-29 19:44:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1356879097, now seen corresponding path program 1 times [2020-11-29 19:44:20,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:21,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568539303] [2020-11-29 19:44:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:21,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568539303] [2020-11-29 19:44:21,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692009817] [2020-11-29 19:44:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:44:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:21,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:44:21,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:44:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:21,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:44:21,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-29 19:44:21,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758773759] [2020-11-29 19:44:21,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:44:21,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:44:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:44:21,889 INFO L87 Difference]: Start difference. First operand 3005 states and 3629 transitions. Second operand 16 states. [2020-11-29 19:44:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:29,835 INFO L93 Difference]: Finished difference Result 22360 states and 27617 transitions. [2020-11-29 19:44:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-11-29 19:44:29,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 236 [2020-11-29 19:44:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:29,858 INFO L225 Difference]: With dead ends: 22360 [2020-11-29 19:44:29,858 INFO L226 Difference]: Without dead ends: 19890 [2020-11-29 19:44:29,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1198, Invalid=4204, Unknown=0, NotChecked=0, Total=5402 [2020-11-29 19:44:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19890 states. [2020-11-29 19:44:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19890 to 3015. [2020-11-29 19:44:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2020-11-29 19:44:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 3644 transitions. [2020-11-29 19:44:30,513 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 3644 transitions. Word has length 236 [2020-11-29 19:44:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:30,513 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 3644 transitions. [2020-11-29 19:44:30,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:44:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 3644 transitions. [2020-11-29 19:44:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 19:44:30,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:30,518 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-29 19:44:30,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:44:30,719 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-29 19:44:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash 997506185, now seen corresponding path program 1 times [2020-11-29 19:44:30,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:30,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395764607] [2020-11-29 19:44:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:30,967 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-29 19:44:30,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395764607] [2020-11-29 19:44:30,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:30,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:44:30,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316979062] [2020-11-29 19:44:30,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:44:30,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:44:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:44:30,970 INFO L87 Difference]: Start difference. First operand 3015 states and 3644 transitions. Second operand 5 states. [2020-11-29 19:44:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:31,618 INFO L93 Difference]: Finished difference Result 5730 states and 6937 transitions. [2020-11-29 19:44:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:44:31,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2020-11-29 19:44:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:31,621 INFO L225 Difference]: With dead ends: 5730 [2020-11-29 19:44:31,621 INFO L226 Difference]: Without dead ends: 3035 [2020-11-29 19:44:31,624 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-29 19:44:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2020-11-29 19:44:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3005. [2020-11-29 19:44:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2020-11-29 19:44:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3629 transitions. [2020-11-29 19:44:32,154 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3629 transitions. Word has length 236 [2020-11-29 19:44:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:32,154 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3629 transitions. [2020-11-29 19:44:32,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:44:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3629 transitions. [2020-11-29 19:44:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 19:44:32,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:32,158 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-29 19:44:32,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-29 19:44:32,159 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-29 19:44:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2054579209, now seen corresponding path program 1 times [2020-11-29 19:44:32,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:32,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193178124] [2020-11-29 19:44:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:32,284 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-29 19:44:32,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193178124] [2020-11-29 19:44:32,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:32,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:44:32,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72362815] [2020-11-29 19:44:32,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:44:32,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:32,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:44:32,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:44:32,286 INFO L87 Difference]: Start difference. First operand 3005 states and 3629 transitions. Second operand 3 states. [2020-11-29 19:44:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:32,819 INFO L93 Difference]: Finished difference Result 5416 states and 6530 transitions. [2020-11-29 19:44:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:44:32,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2020-11-29 19:44:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:32,822 INFO L225 Difference]: With dead ends: 5416 [2020-11-29 19:44:32,822 INFO L226 Difference]: Without dead ends: 2717 [2020-11-29 19:44:32,825 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-29 19:44:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2020-11-29 19:44:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2717. [2020-11-29 19:44:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2020-11-29 19:44:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3250 transitions. [2020-11-29 19:44:33,309 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3250 transitions. Word has length 236 [2020-11-29 19:44:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:33,309 INFO L481 AbstractCegarLoop]: Abstraction has 2717 states and 3250 transitions. [2020-11-29 19:44:33,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:44:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3250 transitions. [2020-11-29 19:44:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 19:44:33,313 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:33,314 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-29 19:44:33,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-29 19:44:33,315 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-29 19:44:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1391949530, now seen corresponding path program 1 times [2020-11-29 19:44:33,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:33,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111426703] [2020-11-29 19:44:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:33,803 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-29 19:44:33,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111426703] [2020-11-29 19:44:33,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778815137] [2020-11-29 19:44:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:44:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:34,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:44:34,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:44:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:34,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:44:34,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-29 19:44:34,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529629197] [2020-11-29 19:44:34,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-29 19:44:34,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 19:44:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:44:34,478 INFO L87 Difference]: Start difference. First operand 2717 states and 3250 transitions. Second operand 21 states. [2020-11-29 19:44:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:43,250 INFO L93 Difference]: Finished difference Result 20891 states and 25234 transitions. [2020-11-29 19:44:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-29 19:44:43,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 236 [2020-11-29 19:44:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:43,265 INFO L225 Difference]: With dead ends: 20891 [2020-11-29 19:44:43,265 INFO L226 Difference]: Without dead ends: 18664 [2020-11-29 19:44:43,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-29 19:44:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2020-11-29 19:44:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 2727. [2020-11-29 19:44:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2727 states. [2020-11-29 19:44:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3265 transitions. [2020-11-29 19:44:43,879 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3265 transitions. Word has length 236 [2020-11-29 19:44:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:43,879 INFO L481 AbstractCegarLoop]: Abstraction has 2727 states and 3265 transitions. [2020-11-29 19:44:43,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-29 19:44:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3265 transitions. [2020-11-29 19:44:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 19:44:43,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:43,883 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-29 19:44:44,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-11-29 19:44:44,084 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-29 19:44:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1026534948, now seen corresponding path program 1 times [2020-11-29 19:44:44,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:44,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759828887] [2020-11-29 19:44:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:44:44,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759828887] [2020-11-29 19:44:44,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:44,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:44:44,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963189994] [2020-11-29 19:44:44,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:44:44,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:44:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:44:44,317 INFO L87 Difference]: Start difference. First operand 2727 states and 3265 transitions. Second operand 5 states. [2020-11-29 19:44:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:44,951 INFO L93 Difference]: Finished difference Result 5192 states and 6227 transitions. [2020-11-29 19:44:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:44:44,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2020-11-29 19:44:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:44,954 INFO L225 Difference]: With dead ends: 5192 [2020-11-29 19:44:44,954 INFO L226 Difference]: Without dead ends: 2777 [2020-11-29 19:44:44,957 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-29 19:44:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2020-11-29 19:44:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2717. [2020-11-29 19:44:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2020-11-29 19:44:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3250 transitions. [2020-11-29 19:44:45,534 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3250 transitions. Word has length 236 [2020-11-29 19:44:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:45,534 INFO L481 AbstractCegarLoop]: Abstraction has 2717 states and 3250 transitions. [2020-11-29 19:44:45,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:44:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3250 transitions. [2020-11-29 19:44:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-29 19:44:45,538 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:45,538 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, 1] [2020-11-29 19:44:45,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-29 19:44:45,539 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-29 19:44:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:45,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1389571169, now seen corresponding path program 1 times [2020-11-29 19:44:45,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:45,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365186523] [2020-11-29 19:44:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:45,970 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-29 19:44:45,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365186523] [2020-11-29 19:44:45,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996877616] [2020-11-29 19:44:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:44:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:46,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:44:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:44:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:44:46,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:44:46,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-29 19:44:46,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693445801] [2020-11-29 19:44:46,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-29 19:44:46,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 19:44:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:44:46,642 INFO L87 Difference]: Start difference. First operand 2717 states and 3250 transitions. Second operand 21 states. [2020-11-29 19:44:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:55,751 INFO L93 Difference]: Finished difference Result 20891 states and 25234 transitions. [2020-11-29 19:44:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-29 19:44:55,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 237 [2020-11-29 19:44:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:55,763 INFO L225 Difference]: With dead ends: 20891 [2020-11-29 19:44:55,763 INFO L226 Difference]: Without dead ends: 18664 [2020-11-29 19:44:55,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-29 19:44:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2020-11-29 19:44:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 2727. [2020-11-29 19:44:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2727 states. [2020-11-29 19:44:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3265 transitions. [2020-11-29 19:44:56,284 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3265 transitions. Word has length 237 [2020-11-29 19:44:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:56,284 INFO L481 AbstractCegarLoop]: Abstraction has 2727 states and 3265 transitions. [2020-11-29 19:44:56,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-29 19:44:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3265 transitions. [2020-11-29 19:44:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-29 19:44:56,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:56,288 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, 1] [2020-11-29 19:44:56,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-11-29 19:44:56,488 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-29 19:44:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1028913309, now seen corresponding path program 1 times [2020-11-29 19:44:56,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:56,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163421257] [2020-11-29 19:44:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:44:56,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163421257] [2020-11-29 19:44:56,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:56,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:44:56,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137819068] [2020-11-29 19:44:56,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:44:56,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:56,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:44:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:44:56,797 INFO L87 Difference]: Start difference. First operand 2727 states and 3265 transitions. Second operand 5 states. [2020-11-29 19:44:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:57,448 INFO L93 Difference]: Finished difference Result 5192 states and 6227 transitions. [2020-11-29 19:44:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:44:57,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2020-11-29 19:44:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:57,451 INFO L225 Difference]: With dead ends: 5192 [2020-11-29 19:44:57,451 INFO L226 Difference]: Without dead ends: 2777 [2020-11-29 19:44:57,453 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-29 19:44:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2020-11-29 19:44:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2717. [2020-11-29 19:44:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2020-11-29 19:44:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3250 transitions. [2020-11-29 19:44:58,005 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3250 transitions. Word has length 237 [2020-11-29 19:44:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:58,005 INFO L481 AbstractCegarLoop]: Abstraction has 2717 states and 3250 transitions. [2020-11-29 19:44:58,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:44:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3250 transitions. [2020-11-29 19:44:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-29 19:44:58,010 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:58,010 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, 1] [2020-11-29 19:44:58,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-11-29 19:44:58,011 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-29 19:44:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash 803294947, now seen corresponding path program 1 times [2020-11-29 19:44:58,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:58,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617025376] [2020-11-29 19:44:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:44:58,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617025376] [2020-11-29 19:44:58,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:58,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:44:58,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054974927] [2020-11-29 19:44:58,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:44:58,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:44:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:44:58,134 INFO L87 Difference]: Start difference. First operand 2717 states and 3250 transitions. Second operand 3 states. [2020-11-29 19:44:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:44:58,508 INFO L93 Difference]: Finished difference Result 4246 states and 5080 transitions. [2020-11-29 19:44:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:44:58,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2020-11-29 19:44:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:44:58,511 INFO L225 Difference]: With dead ends: 4246 [2020-11-29 19:44:58,511 INFO L226 Difference]: Without dead ends: 1819 [2020-11-29 19:44:58,512 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-29 19:44:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2020-11-29 19:44:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2020-11-29 19:44:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2020-11-29 19:44:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2155 transitions. [2020-11-29 19:44:58,879 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2155 transitions. Word has length 237 [2020-11-29 19:44:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:44:58,879 INFO L481 AbstractCegarLoop]: Abstraction has 1819 states and 2155 transitions. [2020-11-29 19:44:58,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:44:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2155 transitions. [2020-11-29 19:44:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-11-29 19:44:58,882 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:44:58,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:44:58,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-11-29 19:44:58,883 INFO L429 AbstractCegarLoop]: === Iteration 63 === [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-29 19:44:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:44:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1891298395, now seen corresponding path program 1 times [2020-11-29 19:44:58,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:44:58,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99073272] [2020-11-29 19:44:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:44:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:44:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-29 19:44:59,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99073272] [2020-11-29 19:44:59,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:44:59,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:44:59,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778147722] [2020-11-29 19:44:59,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:44:59,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:44:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:44:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:44:59,016 INFO L87 Difference]: Start difference. First operand 1819 states and 2155 transitions. Second operand 7 states. [2020-11-29 19:45:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:00,091 INFO L93 Difference]: Finished difference Result 4301 states and 5144 transitions. [2020-11-29 19:45:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:45:00,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2020-11-29 19:45:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:00,094 INFO L225 Difference]: With dead ends: 4301 [2020-11-29 19:45:00,094 INFO L226 Difference]: Without dead ends: 2907 [2020-11-29 19:45:00,095 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-29 19:45:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-11-29 19:45:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2026. [2020-11-29 19:45:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2020-11-29 19:45:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2407 transitions. [2020-11-29 19:45:00,498 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2407 transitions. Word has length 241 [2020-11-29 19:45:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:00,498 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2407 transitions. [2020-11-29 19:45:00,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:45:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2407 transitions. [2020-11-29 19:45:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-11-29 19:45:00,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:00,500 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] [2020-11-29 19:45:00,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-11-29 19:45:00,500 INFO L429 AbstractCegarLoop]: === Iteration 64 === [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-29 19:45:00,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash -462416226, now seen corresponding path program 1 times [2020-11-29 19:45:00,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:00,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25255057] [2020-11-29 19:45:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-29 19:45:00,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25255057] [2020-11-29 19:45:00,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:00,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:45:00,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347704089] [2020-11-29 19:45:00,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:45:00,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:45:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:45:00,644 INFO L87 Difference]: Start difference. First operand 2026 states and 2407 transitions. Second operand 7 states. [2020-11-29 19:45:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:01,989 INFO L93 Difference]: Finished difference Result 4583 states and 5483 transitions. [2020-11-29 19:45:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:45:01,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 243 [2020-11-29 19:45:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:01,994 INFO L225 Difference]: With dead ends: 4583 [2020-11-29 19:45:01,994 INFO L226 Difference]: Without dead ends: 2982 [2020-11-29 19:45:01,995 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-29 19:45:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-11-29 19:45:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2101. [2020-11-29 19:45:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-11-29 19:45:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2494 transitions. [2020-11-29 19:45:02,474 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2494 transitions. Word has length 243 [2020-11-29 19:45:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:02,474 INFO L481 AbstractCegarLoop]: Abstraction has 2101 states and 2494 transitions. [2020-11-29 19:45:02,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:45:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2494 transitions. [2020-11-29 19:45:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-11-29 19:45:02,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:02,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:45:02,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-11-29 19:45:02,477 INFO L429 AbstractCegarLoop]: === Iteration 65 === [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-29 19:45:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:02,477 INFO L82 PathProgramCache]: Analyzing trace with hash 302615592, now seen corresponding path program 1 times [2020-11-29 19:45:02,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:02,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931545026] [2020-11-29 19:45:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-11-29 19:45:02,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931545026] [2020-11-29 19:45:02,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:02,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:45:02,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407906769] [2020-11-29 19:45:02,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:45:02,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:45:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:45:02,670 INFO L87 Difference]: Start difference. First operand 2101 states and 2494 transitions. Second operand 7 states. [2020-11-29 19:45:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:03,698 INFO L93 Difference]: Finished difference Result 4370 states and 5219 transitions. [2020-11-29 19:45:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:45:03,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 243 [2020-11-29 19:45:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:03,702 INFO L225 Difference]: With dead ends: 4370 [2020-11-29 19:45:03,702 INFO L226 Difference]: Without dead ends: 2694 [2020-11-29 19:45:03,704 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-29 19:45:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2020-11-29 19:45:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2101. [2020-11-29 19:45:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-11-29 19:45:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2491 transitions. [2020-11-29 19:45:04,204 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2491 transitions. Word has length 243 [2020-11-29 19:45:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:04,204 INFO L481 AbstractCegarLoop]: Abstraction has 2101 states and 2491 transitions. [2020-11-29 19:45:04,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:45:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2491 transitions. [2020-11-29 19:45:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2020-11-29 19:45:04,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:04,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:45:04,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-11-29 19:45:04,207 INFO L429 AbstractCegarLoop]: === Iteration 66 === [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-29 19:45:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 97717043, now seen corresponding path program 1 times [2020-11-29 19:45:04,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:04,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957855275] [2020-11-29 19:45:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-29 19:45:04,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957855275] [2020-11-29 19:45:04,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:04,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:04,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215836890] [2020-11-29 19:45:04,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:04,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:04,371 INFO L87 Difference]: Start difference. First operand 2101 states and 2491 transitions. Second operand 8 states. [2020-11-29 19:45:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:06,713 INFO L93 Difference]: Finished difference Result 6227 states and 7424 transitions. [2020-11-29 19:45:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 19:45:06,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 247 [2020-11-29 19:45:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:06,722 INFO L225 Difference]: With dead ends: 6227 [2020-11-29 19:45:06,722 INFO L226 Difference]: Without dead ends: 4551 [2020-11-29 19:45:06,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:45:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2020-11-29 19:45:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 2083. [2020-11-29 19:45:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2020-11-29 19:45:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2467 transitions. [2020-11-29 19:45:07,234 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2467 transitions. Word has length 247 [2020-11-29 19:45:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:07,234 INFO L481 AbstractCegarLoop]: Abstraction has 2083 states and 2467 transitions. [2020-11-29 19:45:07,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2467 transitions. [2020-11-29 19:45:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-29 19:45:07,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:07,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:45:07,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-11-29 19:45:07,237 INFO L429 AbstractCegarLoop]: === Iteration 67 === [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-29 19:45:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1338760512, now seen corresponding path program 1 times [2020-11-29 19:45:07,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:07,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873365325] [2020-11-29 19:45:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-29 19:45:07,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873365325] [2020-11-29 19:45:07,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:07,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:07,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725305556] [2020-11-29 19:45:07,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:07,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:07,405 INFO L87 Difference]: Start difference. First operand 2083 states and 2467 transitions. Second operand 8 states. [2020-11-29 19:45:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:09,589 INFO L93 Difference]: Finished difference Result 5775 states and 6862 transitions. [2020-11-29 19:45:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:45:09,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2020-11-29 19:45:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:09,593 INFO L225 Difference]: With dead ends: 5775 [2020-11-29 19:45:09,593 INFO L226 Difference]: Without dead ends: 4117 [2020-11-29 19:45:09,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:45:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2020-11-29 19:45:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 2083. [2020-11-29 19:45:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2020-11-29 19:45:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2464 transitions. [2020-11-29 19:45:10,086 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2464 transitions. Word has length 249 [2020-11-29 19:45:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:10,087 INFO L481 AbstractCegarLoop]: Abstraction has 2083 states and 2464 transitions. [2020-11-29 19:45:10,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2464 transitions. [2020-11-29 19:45:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-29 19:45:10,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:10,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:45:10,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-11-29 19:45:10,089 INFO L429 AbstractCegarLoop]: === Iteration 68 === [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-29 19:45:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:10,089 INFO L82 PathProgramCache]: Analyzing trace with hash -383372420, now seen corresponding path program 1 times [2020-11-29 19:45:10,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:10,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101300717] [2020-11-29 19:45:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-29 19:45:10,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101300717] [2020-11-29 19:45:10,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:10,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:10,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041128152] [2020-11-29 19:45:10,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:10,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:10,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:10,245 INFO L87 Difference]: Start difference. First operand 2083 states and 2464 transitions. Second operand 8 states. [2020-11-29 19:45:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:12,026 INFO L93 Difference]: Finished difference Result 5299 states and 6291 transitions. [2020-11-29 19:45:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:45:12,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2020-11-29 19:45:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:12,029 INFO L225 Difference]: With dead ends: 5299 [2020-11-29 19:45:12,030 INFO L226 Difference]: Without dead ends: 3641 [2020-11-29 19:45:12,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:45:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2020-11-29 19:45:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 2068. [2020-11-29 19:45:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2020-11-29 19:45:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2443 transitions. [2020-11-29 19:45:12,504 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2443 transitions. Word has length 249 [2020-11-29 19:45:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:12,505 INFO L481 AbstractCegarLoop]: Abstraction has 2068 states and 2443 transitions. [2020-11-29 19:45:12,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2443 transitions. [2020-11-29 19:45:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-29 19:45:12,507 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:12,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:45:12,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-11-29 19:45:12,507 INFO L429 AbstractCegarLoop]: === Iteration 69 === [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-29 19:45:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash 260433856, now seen corresponding path program 1 times [2020-11-29 19:45:12,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:12,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830175295] [2020-11-29 19:45:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:12,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830175295] [2020-11-29 19:45:12,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394559141] [2020-11-29 19:45:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:45:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:13,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 19:45:13,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:45:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:13,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:45:13,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-11-29 19:45:13,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043649714] [2020-11-29 19:45:13,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:45:13,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:45:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:45:13,286 INFO L87 Difference]: Start difference. First operand 2068 states and 2443 transitions. Second operand 13 states. [2020-11-29 19:45:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:29,616 INFO L93 Difference]: Finished difference Result 12916 states and 15293 transitions. [2020-11-29 19:45:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 321 states. [2020-11-29 19:45:29,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2020-11-29 19:45:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:29,624 INFO L225 Difference]: With dead ends: 12916 [2020-11-29 19:45:29,624 INFO L226 Difference]: Without dead ends: 11273 [2020-11-29 19:45:29,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49385 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=8307, Invalid=100923, Unknown=0, NotChecked=0, Total=109230 [2020-11-29 19:45:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2020-11-29 19:45:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 2574. [2020-11-29 19:45:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2020-11-29 19:45:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3024 transitions. [2020-11-29 19:45:30,512 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3024 transitions. Word has length 249 [2020-11-29 19:45:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:30,513 INFO L481 AbstractCegarLoop]: Abstraction has 2574 states and 3024 transitions. [2020-11-29 19:45:30,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:45:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3024 transitions. [2020-11-29 19:45:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-11-29 19:45:30,515 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:30,515 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, 1, 1] [2020-11-29 19:45:30,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2020-11-29 19:45:30,716 INFO L429 AbstractCegarLoop]: === Iteration 70 === [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-29 19:45:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1682606629, now seen corresponding path program 1 times [2020-11-29 19:45:30,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:30,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765427346] [2020-11-29 19:45:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-29 19:45:30,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765427346] [2020-11-29 19:45:30,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:30,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:30,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200206972] [2020-11-29 19:45:30,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:30,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:30,892 INFO L87 Difference]: Start difference. First operand 2574 states and 3024 transitions. Second operand 8 states. [2020-11-29 19:45:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:34,825 INFO L93 Difference]: Finished difference Result 9024 states and 10665 transitions. [2020-11-29 19:45:34,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 19:45:34,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2020-11-29 19:45:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:34,831 INFO L225 Difference]: With dead ends: 9024 [2020-11-29 19:45:34,831 INFO L226 Difference]: Without dead ends: 6904 [2020-11-29 19:45:34,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:45:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2020-11-29 19:45:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 2539. [2020-11-29 19:45:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2020-11-29 19:45:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 2974 transitions. [2020-11-29 19:45:35,581 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 2974 transitions. Word has length 251 [2020-11-29 19:45:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:35,581 INFO L481 AbstractCegarLoop]: Abstraction has 2539 states and 2974 transitions. [2020-11-29 19:45:35,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2974 transitions. [2020-11-29 19:45:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-11-29 19:45:35,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:35,584 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, 1, 1] [2020-11-29 19:45:35,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-11-29 19:45:35,584 INFO L429 AbstractCegarLoop]: === Iteration 71 === [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-29 19:45:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash -808745437, now seen corresponding path program 1 times [2020-11-29 19:45:35,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:35,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034972989] [2020-11-29 19:45:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-29 19:45:35,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034972989] [2020-11-29 19:45:35,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:35,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:45:35,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963804050] [2020-11-29 19:45:35,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:45:35,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:45:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:45:35,685 INFO L87 Difference]: Start difference. First operand 2539 states and 2974 transitions. Second operand 3 states. [2020-11-29 19:45:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:36,960 INFO L93 Difference]: Finished difference Result 5500 states and 6453 transitions. [2020-11-29 19:45:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:45:36,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2020-11-29 19:45:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:36,963 INFO L225 Difference]: With dead ends: 5500 [2020-11-29 19:45:36,963 INFO L226 Difference]: Without dead ends: 3480 [2020-11-29 19:45:36,964 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-29 19:45:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2020-11-29 19:45:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2539. [2020-11-29 19:45:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2020-11-29 19:45:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 2964 transitions. [2020-11-29 19:45:37,676 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 2964 transitions. Word has length 251 [2020-11-29 19:45:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:37,676 INFO L481 AbstractCegarLoop]: Abstraction has 2539 states and 2964 transitions. [2020-11-29 19:45:37,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:45:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2964 transitions. [2020-11-29 19:45:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-29 19:45:37,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:37,678 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, 1, 1, 1] [2020-11-29 19:45:37,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-11-29 19:45:37,679 INFO L429 AbstractCegarLoop]: === Iteration 72 === [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-29 19:45:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1694038952, now seen corresponding path program 1 times [2020-11-29 19:45:37,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:37,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808393346] [2020-11-29 19:45:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-29 19:45:37,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808393346] [2020-11-29 19:45:37,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:37,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:37,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395907341] [2020-11-29 19:45:37,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:37,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:37,858 INFO L87 Difference]: Start difference. First operand 2539 states and 2964 transitions. Second operand 8 states. [2020-11-29 19:45:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:40,161 INFO L93 Difference]: Finished difference Result 6353 states and 7471 transitions. [2020-11-29 19:45:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:45:40,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2020-11-29 19:45:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:40,165 INFO L225 Difference]: With dead ends: 6353 [2020-11-29 19:45:40,165 INFO L226 Difference]: Without dead ends: 4333 [2020-11-29 19:45:40,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:45:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2020-11-29 19:45:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 2514. [2020-11-29 19:45:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2020-11-29 19:45:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 2924 transitions. [2020-11-29 19:45:40,928 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 2924 transitions. Word has length 252 [2020-11-29 19:45:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:40,929 INFO L481 AbstractCegarLoop]: Abstraction has 2514 states and 2924 transitions. [2020-11-29 19:45:40,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2924 transitions. [2020-11-29 19:45:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-29 19:45:40,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:40,931 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, 1, 1, 1] [2020-11-29 19:45:40,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-11-29 19:45:40,931 INFO L429 AbstractCegarLoop]: === Iteration 73 === [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-29 19:45:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1107232938, now seen corresponding path program 1 times [2020-11-29 19:45:40,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:40,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453066591] [2020-11-29 19:45:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-29 19:45:41,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453066591] [2020-11-29 19:45:41,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:41,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:45:41,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259557740] [2020-11-29 19:45:41,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:45:41,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:45:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:45:41,084 INFO L87 Difference]: Start difference. First operand 2514 states and 2924 transitions. Second operand 8 states. [2020-11-29 19:45:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:43,729 INFO L93 Difference]: Finished difference Result 7075 states and 8293 transitions. [2020-11-29 19:45:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:45:43,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2020-11-29 19:45:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:43,734 INFO L225 Difference]: With dead ends: 7075 [2020-11-29 19:45:43,734 INFO L226 Difference]: Without dead ends: 5080 [2020-11-29 19:45:43,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:45:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2020-11-29 19:45:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 2494. [2020-11-29 19:45:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2494 states. [2020-11-29 19:45:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 2894 transitions. [2020-11-29 19:45:44,612 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 2894 transitions. Word has length 252 [2020-11-29 19:45:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:44,612 INFO L481 AbstractCegarLoop]: Abstraction has 2494 states and 2894 transitions. [2020-11-29 19:45:44,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:45:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 2894 transitions. [2020-11-29 19:45:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-29 19:45:44,614 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:44,615 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, 1, 1, 1] [2020-11-29 19:45:44,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-11-29 19:45:44,615 INFO L429 AbstractCegarLoop]: === Iteration 74 === [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-29 19:45:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash 297886312, now seen corresponding path program 1 times [2020-11-29 19:45:44,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:44,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684560248] [2020-11-29 19:45:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-11-29 19:45:44,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684560248] [2020-11-29 19:45:44,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:45:44,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:45:44,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046911981] [2020-11-29 19:45:44,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:45:44,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:45:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:45:44,776 INFO L87 Difference]: Start difference. First operand 2494 states and 2894 transitions. Second operand 4 states. [2020-11-29 19:45:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:46,187 INFO L93 Difference]: Finished difference Result 5345 states and 6277 transitions. [2020-11-29 19:45:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:45:46,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2020-11-29 19:45:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:46,190 INFO L225 Difference]: With dead ends: 5345 [2020-11-29 19:45:46,190 INFO L226 Difference]: Without dead ends: 3370 [2020-11-29 19:45:46,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:45:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2020-11-29 19:45:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2494. [2020-11-29 19:45:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2494 states. [2020-11-29 19:45:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 2884 transitions. [2020-11-29 19:45:47,028 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 2884 transitions. Word has length 252 [2020-11-29 19:45:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:47,028 INFO L481 AbstractCegarLoop]: Abstraction has 2494 states and 2884 transitions. [2020-11-29 19:45:47,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:45:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 2884 transitions. [2020-11-29 19:45:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-29 19:45:47,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:47,032 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, 1, 1, 1] [2020-11-29 19:45:47,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-11-29 19:45:47,032 INFO L429 AbstractCegarLoop]: === Iteration 75 === [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-29 19:45:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash 304768033, now seen corresponding path program 1 times [2020-11-29 19:45:47,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:47,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933075379] [2020-11-29 19:45:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:47,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933075379] [2020-11-29 19:45:47,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515381011] [2020-11-29 19:45:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:45:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:47,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:45:47,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:45:47,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:45:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:48,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:45:48,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-29 19:45:48,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789109790] [2020-11-29 19:45:48,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:45:48,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:45:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:45:48,340 INFO L87 Difference]: Start difference. First operand 2494 states and 2884 transitions. Second operand 16 states. [2020-11-29 19:45:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:45:54,049 INFO L93 Difference]: Finished difference Result 9912 states and 11512 transitions. [2020-11-29 19:45:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-29 19:45:54,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 252 [2020-11-29 19:45:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:45:54,056 INFO L225 Difference]: With dead ends: 9912 [2020-11-29 19:45:54,056 INFO L226 Difference]: Without dead ends: 7937 [2020-11-29 19:45:54,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=608, Invalid=1942, Unknown=0, NotChecked=0, Total=2550 [2020-11-29 19:45:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states. [2020-11-29 19:45:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 3273. [2020-11-29 19:45:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2020-11-29 19:45:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 3775 transitions. [2020-11-29 19:45:55,277 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 3775 transitions. Word has length 252 [2020-11-29 19:45:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:45:55,277 INFO L481 AbstractCegarLoop]: Abstraction has 3273 states and 3775 transitions. [2020-11-29 19:45:55,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:45:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3775 transitions. [2020-11-29 19:45:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-11-29 19:45:55,281 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:45:55,281 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, 1, 1, 1, 1] [2020-11-29 19:45:55,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2020-11-29 19:45:55,482 INFO L429 AbstractCegarLoop]: === Iteration 76 === [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-29 19:45:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:45:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash -886454654, now seen corresponding path program 1 times [2020-11-29 19:45:55,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:45:55,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839112675] [2020-11-29 19:45:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:45:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:56,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839112675] [2020-11-29 19:45:56,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51838087] [2020-11-29 19:45:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:45:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:45:56,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:45:56,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:45:56,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:45:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:45:58,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:45:58,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-29 19:45:58,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212818406] [2020-11-29 19:45:58,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:45:58,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:45:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:45:58,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:45:58,477 INFO L87 Difference]: Start difference. First operand 3273 states and 3775 transitions. Second operand 16 states. [2020-11-29 19:46:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:46:06,067 INFO L93 Difference]: Finished difference Result 12278 states and 14221 transitions. [2020-11-29 19:46:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-29 19:46:06,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 253 [2020-11-29 19:46:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:46:06,075 INFO L225 Difference]: With dead ends: 12278 [2020-11-29 19:46:06,075 INFO L226 Difference]: Without dead ends: 9588 [2020-11-29 19:46:06,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=609, Invalid=1941, Unknown=0, NotChecked=0, Total=2550 [2020-11-29 19:46:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9588 states. [2020-11-29 19:46:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9588 to 3273. [2020-11-29 19:46:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2020-11-29 19:46:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 3775 transitions. [2020-11-29 19:46:07,533 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 3775 transitions. Word has length 253 [2020-11-29 19:46:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:46:07,533 INFO L481 AbstractCegarLoop]: Abstraction has 3273 states and 3775 transitions. [2020-11-29 19:46:07,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:46:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3775 transitions. [2020-11-29 19:46:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-11-29 19:46:07,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:46:07,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:46:07,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:46:07,737 INFO L429 AbstractCegarLoop]: === Iteration 77 === [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-29 19:46:07,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:46:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash -749846274, now seen corresponding path program 1 times [2020-11-29 19:46:07,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:46:07,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576879876] [2020-11-29 19:46:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:46:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-29 19:46:08,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576879876] [2020-11-29 19:46:08,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167426419] [2020-11-29 19:46:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/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-29 19:46:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:08,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-29 19:46:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:46:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:46:08,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:46:08,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2020-11-29 19:46:08,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134789504] [2020-11-29 19:46:08,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-29 19:46:08,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:46:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 19:46:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-11-29 19:46:08,943 INFO L87 Difference]: Start difference. First operand 3273 states and 3775 transitions. Second operand 23 states. [2020-11-29 19:46:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:46:34,952 INFO L93 Difference]: Finished difference Result 23160 states and 27004 transitions. [2020-11-29 19:46:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2020-11-29 19:46:34,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 254 [2020-11-29 19:46:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:46:34,969 INFO L225 Difference]: With dead ends: 23160 [2020-11-29 19:46:34,969 INFO L226 Difference]: Without dead ends: 20404 [2020-11-29 19:46:34,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9885 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4411, Invalid=26389, Unknown=0, NotChecked=0, Total=30800 [2020-11-29 19:46:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2020-11-29 19:46:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 4885. [2020-11-29 19:46:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4885 states. [2020-11-29 19:46:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4885 states to 4885 states and 5640 transitions. [2020-11-29 19:46:37,233 INFO L78 Accepts]: Start accepts. Automaton has 4885 states and 5640 transitions. Word has length 254 [2020-11-29 19:46:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:46:37,233 INFO L481 AbstractCegarLoop]: Abstraction has 4885 states and 5640 transitions. [2020-11-29 19:46:37,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-29 19:46:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4885 states and 5640 transitions. [2020-11-29 19:46:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-29 19:46:37,238 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:46:37,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:46:37,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2020-11-29 19:46:37,439 INFO L429 AbstractCegarLoop]: === Iteration 78 === [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-29 19:46:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:46:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash 538886353, now seen corresponding path program 1 times [2020-11-29 19:46:37,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:46:37,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052661172] [2020-11-29 19:46:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:46:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-11-29 19:46:37,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052661172] [2020-11-29 19:46:37,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:46:37,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:46:37,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349172133] [2020-11-29 19:46:37,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:46:37,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:46:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:46:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:46:37,525 INFO L87 Difference]: Start difference. First operand 4885 states and 5640 transitions. Second operand 3 states. [2020-11-29 19:46:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:46:39,710 INFO L93 Difference]: Finished difference Result 9357 states and 10793 transitions. [2020-11-29 19:46:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:46:39,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2020-11-29 19:46:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:46:39,714 INFO L225 Difference]: With dead ends: 9357 [2020-11-29 19:46:39,714 INFO L226 Difference]: Without dead ends: 4485 [2020-11-29 19:46:39,716 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-29 19:46:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2020-11-29 19:46:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4485. [2020-11-29 19:46:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2020-11-29 19:46:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 5159 transitions. [2020-11-29 19:46:41,615 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 5159 transitions. Word has length 257 [2020-11-29 19:46:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:46:41,615 INFO L481 AbstractCegarLoop]: Abstraction has 4485 states and 5159 transitions. [2020-11-29 19:46:41,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:46:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 5159 transitions. [2020-11-29 19:46:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-11-29 19:46:41,621 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:46:41,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:46:41,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-11-29 19:46:41,622 INFO L429 AbstractCegarLoop]: === Iteration 79 === [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-29 19:46:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:46:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1282533970, now seen corresponding path program 1 times [2020-11-29 19:46:41,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:46:41,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014793757] [2020-11-29 19:46:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:46:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:46:42,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014793757] [2020-11-29 19:46:42,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11839739] [2020-11-29 19:46:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:46:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:42,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:46:42,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:46:42,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:46:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-29 19:46:42,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:46:42,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-29 19:46:42,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990913512] [2020-11-29 19:46:42,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:46:42,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:46:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:46:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:46:42,829 INFO L87 Difference]: Start difference. First operand 4485 states and 5159 transitions. Second operand 16 states. [2020-11-29 19:46:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:46:51,523 INFO L93 Difference]: Finished difference Result 15843 states and 18381 transitions. [2020-11-29 19:46:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-29 19:46:51,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2020-11-29 19:46:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:46:51,531 INFO L225 Difference]: With dead ends: 15843 [2020-11-29 19:46:51,531 INFO L226 Difference]: Without dead ends: 12067 [2020-11-29 19:46:51,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=609, Invalid=1941, Unknown=0, NotChecked=0, Total=2550 [2020-11-29 19:46:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2020-11-29 19:46:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 4321. [2020-11-29 19:46:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2020-11-29 19:46:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4963 transitions. [2020-11-29 19:46:53,451 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4963 transitions. Word has length 260 [2020-11-29 19:46:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:46:53,451 INFO L481 AbstractCegarLoop]: Abstraction has 4321 states and 4963 transitions. [2020-11-29 19:46:53,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:46:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4963 transitions. [2020-11-29 19:46:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-11-29 19:46:53,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:46:53,456 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, 1, 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-29 19:46:53,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-11-29 19:46:53,682 INFO L429 AbstractCegarLoop]: === Iteration 80 === [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-29 19:46:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:46:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash -143831848, now seen corresponding path program 1 times [2020-11-29 19:46:53,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:46:53,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098693653] [2020-11-29 19:46:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:46:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-11-29 19:46:54,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098693653] [2020-11-29 19:46:54,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549122559] [2020-11-29 19:46:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:46:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:46:54,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:46:54,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:46:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-11-29 19:46:54,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:46:54,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 19:46:54,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955072046] [2020-11-29 19:46:54,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:46:54,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:46:54,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:46:54,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:46:54,449 INFO L87 Difference]: Start difference. First operand 4321 states and 4963 transitions. Second operand 10 states. [2020-11-29 19:46:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:46:57,947 INFO L93 Difference]: Finished difference Result 9841 states and 11438 transitions. [2020-11-29 19:46:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:46:57,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 261 [2020-11-29 19:46:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:46:57,953 INFO L225 Difference]: With dead ends: 9841 [2020-11-29 19:46:57,953 INFO L226 Difference]: Without dead ends: 6124 [2020-11-29 19:46:57,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:46:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6124 states. [2020-11-29 19:46:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6124 to 4321. [2020-11-29 19:46:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2020-11-29 19:46:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4955 transitions. [2020-11-29 19:46:59,843 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4955 transitions. Word has length 261 [2020-11-29 19:46:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:46:59,844 INFO L481 AbstractCegarLoop]: Abstraction has 4321 states and 4955 transitions. [2020-11-29 19:46:59,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:46:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4955 transitions. [2020-11-29 19:46:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-11-29 19:46:59,848 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:46:59,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 19:47:00,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:47:00,049 INFO L429 AbstractCegarLoop]: === Iteration 81 === [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-29 19:47:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:47:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 512866629, now seen corresponding path program 1 times [2020-11-29 19:47:00,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:47:00,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538829135] [2020-11-29 19:47:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:47:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:47:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-29 19:47:00,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538829135] [2020-11-29 19:47:00,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877615913] [2020-11-29 19:47:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:47:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:47:00,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:47:00,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:47:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-29 19:47:00,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:47:00,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 19:47:00,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503329482] [2020-11-29 19:47:00,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:47:00,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:47:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:47:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:47:00,895 INFO L87 Difference]: Start difference. First operand 4321 states and 4955 transitions. Second operand 10 states. [2020-11-29 19:47:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:47:05,503 INFO L93 Difference]: Finished difference Result 11356 states and 13311 transitions. [2020-11-29 19:47:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:47:05,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2020-11-29 19:47:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:47:05,510 INFO L225 Difference]: With dead ends: 11356 [2020-11-29 19:47:05,510 INFO L226 Difference]: Without dead ends: 7639 [2020-11-29 19:47:05,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-11-29 19:47:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2020-11-29 19:47:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 4321. [2020-11-29 19:47:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2020-11-29 19:47:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 4947 transitions. [2020-11-29 19:47:07,479 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 4947 transitions. Word has length 268 [2020-11-29 19:47:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:47:07,479 INFO L481 AbstractCegarLoop]: Abstraction has 4321 states and 4947 transitions. [2020-11-29 19:47:07,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:47:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 4947 transitions. [2020-11-29 19:47:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-11-29 19:47:07,484 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:47:07,485 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, 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] [2020-11-29 19:47:07,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:47:07,702 INFO L429 AbstractCegarLoop]: === Iteration 82 === [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-29 19:47:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:47:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash 958853259, now seen corresponding path program 1 times [2020-11-29 19:47:07,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:47:07,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495759779] [2020-11-29 19:47:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:47:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:47:07,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:47:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:47:07,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:47:08,064 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:47:08,064 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:47:08,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2020-11-29 19:47:08,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:47:08 BoogieIcfgContainer [2020-11-29 19:47:08,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:47:08,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:47:08,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:47:08,469 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:47:08,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:43:05" (3/4) ... [2020-11-29 19:47:08,471 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:47:08,851 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1a065378-50fe-4781-b665-c9cfe7a65fd3/bin/uautomizer/witness.graphml [2020-11-29 19:47:08,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:47:08,854 INFO L168 Benchmark]: Toolchain (without parser) took 246747.60 ms. Allocated memory was 109.1 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 72.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 937.8 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,854 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 109.1 MB. Free memory was 80.9 MB in the beginning and 80.9 MB in the end (delta: 30.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:47:08,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.13 ms. Allocated memory is still 109.1 MB. Free memory was 72.2 MB in the beginning and 78.4 MB in the end (delta: -6.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.87 ms. Allocated memory is still 109.1 MB. Free memory was 78.4 MB in the beginning and 72.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,856 INFO L168 Benchmark]: Boogie Preprocessor took 126.75 ms. Allocated memory is still 109.1 MB. Free memory was 72.2 MB in the beginning and 66.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,856 INFO L168 Benchmark]: RCFGBuilder took 2581.56 ms. Allocated memory was 109.1 MB in the beginning and 148.9 MB in the end (delta: 39.8 MB). Free memory was 66.4 MB in the beginning and 63.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,857 INFO L168 Benchmark]: TraceAbstraction took 243039.49 ms. Allocated memory was 148.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 63.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 819.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,857 INFO L168 Benchmark]: Witness Printer took 382.84 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 71.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:47:08,861 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.37 ms. Allocated memory is still 109.1 MB. Free memory was 80.9 MB in the beginning and 80.9 MB in the end (delta: 30.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 484.13 ms. Allocated memory is still 109.1 MB. Free memory was 72.2 MB in the beginning and 78.4 MB in the end (delta: -6.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 124.87 ms. Allocated memory is still 109.1 MB. Free memory was 78.4 MB in the beginning and 72.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 126.75 ms. Allocated memory is still 109.1 MB. Free memory was 72.2 MB in the beginning and 66.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2581.56 ms. Allocated memory was 109.1 MB in the beginning and 148.9 MB in the end (delta: 39.8 MB). Free memory was 66.4 MB in the beginning and 63.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 243039.49 ms. Allocated memory was 148.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 63.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 819.4 MB. Max. memory is 16.1 GB. * Witness Printer took 382.84 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 71.3 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 ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L472] int c1 ; [L473] int i2 ; [L476] c1 = 0 [L477] gate1Failed = __VERIFIER_nondet_bool() [L478] gate2Failed = __VERIFIER_nondet_bool() [L479] gate3Failed = __VERIFIER_nondet_bool() [L480] VALUE1 = __VERIFIER_nondet_char() [L481] VALUE2 = __VERIFIER_nondet_char() [L482] VALUE3 = __VERIFIER_nondet_char() [L483] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L484] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L485] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L486] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L487] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L488] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L489] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L490] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L491] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L492] votedValue_History_0 = __VERIFIER_nondet_char() [L493] votedValue_History_1 = __VERIFIER_nondet_char() [L494] votedValue_History_2 = __VERIFIER_nondet_char() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L495] i2 = init() [L496] COND FALSE !(!(i2)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=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] [L497] g1v_old = nomsg [L498] g1v_new = nomsg [L499] g2v_old = nomsg [L500] g2v_new = nomsg [L501] g3v_old = nomsg [L502] g3v_new = nomsg [L503] 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] [L504] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, 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] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, 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] [L351] COND FALSE !((int )next_state == 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=0, gate1Failed_History_0=0, 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] [L354] COND TRUE (int )next_state == 1 [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=-1, gate1Failed=0, gate1Failed_History_0=0, 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] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, 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] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, 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] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, 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=0, gate1Failed_History_2=5, gate2Failed=0, 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L376] COND FALSE !(\read(gate2Failed)) [L380] tmp = __VERIFIER_nondet_char() [L381] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L382] COND TRUE (int )next_state == 0 [L383] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L393] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L394] EXPR next_state != nomsg && g2v_new == nomsg ? next_state : 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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L394] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L186] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L442] COND TRUE (int )VALUE1 == (int )nomsg [L443] voted_value = VALUE3 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L127] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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 TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L137] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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 TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L147] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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 TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L107] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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 == 1 [L111] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L333] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L516] c1 = check() [L529] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L518] i2 ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, 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] [L504] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, 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=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] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, 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=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] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, 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=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] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, 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=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] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, 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=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] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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] [L186] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L441] COND FALSE !((int )VALUE1 == (int )VALUE2) 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L448] COND FALSE !((int )VALUE1 == (int )VALUE3) 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L455] COND TRUE (int )VALUE1 != (int )nomsg [L456] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND FALSE !((int )VALUE2 == (int )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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND FALSE !((int )VALUE3 == (int )tmp___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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L280] COND TRUE (int )VALUE1 != (int )VALUE2 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L281] COND TRUE (int )VALUE1 != (int )VALUE3 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L282] COND FALSE !((int )VALUE2 != (int )VALUE3) 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! (temp_count > 1) [L295] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L516] c1 = check() [L529] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L3] __assert_fail("0", "pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 554 locations, 37 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 242.5s, OverallIterations: 82, TraceHistogramMax: 3, AutomataDifference: 171.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41368 SDtfs, 61365 SDslu, 170197 SDs, 0 SdLazy, 33995 SolverSat, 1064 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6839 GetRequests, 5128 SyntacticMatches, 7 SemanticMatches, 1704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78663 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4885occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.1s AutomataMinimizationTime, 81 MinimizatonAttempts, 204332 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 20270 NumberOfCodeBlocks, 20270 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 19882 ConstructedInterpolants, 94 QuantifiedInterpolants, 17218094 SizeOfPredicates, 115 NumberOfNonLiveVariables, 20985 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 104 InterpolantComputations, 63 PerfectInterpolantSequences, 12334/13177 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...