./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2255bd39401605e8aa4bbdae0287bc8d412fffe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.24-678e011 [2019-11-20 07:52:22,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:52:22,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:52:22,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:52:22,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:52:22,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:52:22,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:52:22,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:52:22,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:52:22,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:52:22,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:52:22,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:52:22,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:52:22,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:52:22,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:52:22,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:52:23,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:52:23,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:52:23,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:52:23,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:52:23,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:52:23,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:52:23,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:52:23,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:52:23,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:52:23,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:52:23,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:52:23,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:52:23,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:52:23,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:52:23,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:52:23,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:52:23,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:52:23,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:52:23,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:52:23,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:52:23,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:52:23,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:52:23,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:52:23,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:52:23,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:52:23,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:52:23,051 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:52:23,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:52:23,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:52:23,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:52:23,052 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:52:23,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:52:23,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:52:23,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:52:23,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:52:23,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:52:23,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:52:23,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:52:23,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:52:23,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:52:23,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:52:23,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:52:23,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:52:23,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:52:23,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:52:23,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:52:23,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:52:23,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:52:23,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:52:23,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:52:23,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:52:23,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:52:23,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:52:23,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:52:23,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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(__VERIFIER_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 -> a2255bd39401605e8aa4bbdae0287bc8d412fffe [2019-11-20 07:52:23,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:52:23,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:52:23,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:52:23,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:52:23,248 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:52:23,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-20 07:52:23,309 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/data/32d694f71/03858be0650c4bd8a6c51068b88c26f8/FLAG84fba5c84 [2019-11-20 07:52:23,711 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:52:23,712 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-20 07:52:23,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/data/32d694f71/03858be0650c4bd8a6c51068b88c26f8/FLAG84fba5c84 [2019-11-20 07:52:24,068 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/data/32d694f71/03858be0650c4bd8a6c51068b88c26f8 [2019-11-20 07:52:24,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:52:24,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:52:24,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:52:24,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:52:24,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:52:24,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe37aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24, skipping insertion in model container [2019-11-20 07:52:24,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:52:24,141 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:52:24,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:52:24,475 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:52:24,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:52:24,547 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:52:24,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24 WrapperNode [2019-11-20 07:52:24,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:52:24,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:52:24,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:52:24,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:52:24,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:52:24,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:52:24,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:52:24,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:52:24,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... [2019-11-20 07:52:24,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:52:24,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:52:24,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:52:24,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:52:24,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:52:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:52:24,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:52:26,417 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:52:26,417 INFO L285 CfgBuilder]: Removed 173 assume(true) statements. [2019-11-20 07:52:26,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:52:26 BoogieIcfgContainer [2019-11-20 07:52:26,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:52:26,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:52:26,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:52:26,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:52:26,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:52:24" (1/3) ... [2019-11-20 07:52:26,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2391d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:52:26, skipping insertion in model container [2019-11-20 07:52:26,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:52:24" (2/3) ... [2019-11-20 07:52:26,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2391d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:52:26, skipping insertion in model container [2019-11-20 07:52:26,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:52:26" (3/3) ... [2019-11-20 07:52:26,431 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-20 07:52:26,440 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:52:26,449 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-20 07:52:26,460 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-20 07:52:26,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:52:26,498 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:52:26,498 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:52:26,498 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:52:26,498 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:52:26,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:52:26,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:52:26,499 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:52:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states. [2019-11-20 07:52:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 07:52:26,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:26,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:26,550 INFO L410 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]=== [2019-11-20 07:52:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2019-11-20 07:52:26,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:26,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277930252] [2019-11-20 07:52:26,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:52:26,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277930252] [2019-11-20 07:52:26,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:26,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:26,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109446947] [2019-11-20 07:52:26,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:26,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:26,818 INFO L87 Difference]: Start difference. First operand 514 states. Second operand 3 states. [2019-11-20 07:52:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:27,077 INFO L93 Difference]: Finished difference Result 1224 states and 2024 transitions. [2019-11-20 07:52:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:27,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 07:52:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:27,099 INFO L225 Difference]: With dead ends: 1224 [2019-11-20 07:52:27,099 INFO L226 Difference]: Without dead ends: 712 [2019-11-20 07:52:27,108 INFO L630 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 [2019-11-20 07:52:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-20 07:52:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 450. [2019-11-20 07:52:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-20 07:52:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 705 transitions. [2019-11-20 07:52:27,193 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 705 transitions. Word has length 9 [2019-11-20 07:52:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:27,194 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 705 transitions. [2019-11-20 07:52:27,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 705 transitions. [2019-11-20 07:52:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 07:52:27,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:27,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:27,197 INFO L410 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]=== [2019-11-20 07:52:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2019-11-20 07:52:27,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:27,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156826236] [2019-11-20 07:52:27,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:52:27,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156826236] [2019-11-20 07:52:27,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:27,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:27,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62921942] [2019-11-20 07:52:27,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:27,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:27,247 INFO L87 Difference]: Start difference. First operand 450 states and 705 transitions. Second operand 3 states. [2019-11-20 07:52:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:27,338 INFO L93 Difference]: Finished difference Result 1110 states and 1725 transitions. [2019-11-20 07:52:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:27,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 07:52:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:27,343 INFO L225 Difference]: With dead ends: 1110 [2019-11-20 07:52:27,343 INFO L226 Difference]: Without dead ends: 662 [2019-11-20 07:52:27,345 INFO L630 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 [2019-11-20 07:52:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-20 07:52:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 417. [2019-11-20 07:52:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-20 07:52:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 647 transitions. [2019-11-20 07:52:27,370 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 647 transitions. Word has length 10 [2019-11-20 07:52:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:27,371 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 647 transitions. [2019-11-20 07:52:27,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 647 transitions. [2019-11-20 07:52:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 07:52:27,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:27,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:27,379 INFO L410 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]=== [2019-11-20 07:52:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -674152124, now seen corresponding path program 1 times [2019-11-20 07:52:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:27,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440430325] [2019-11-20 07:52:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:52:27,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440430325] [2019-11-20 07:52:27,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:27,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:27,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084186710] [2019-11-20 07:52:27,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:27,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:27,449 INFO L87 Difference]: Start difference. First operand 417 states and 647 transitions. Second operand 3 states. [2019-11-20 07:52:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:27,527 INFO L93 Difference]: Finished difference Result 1229 states and 1912 transitions. [2019-11-20 07:52:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:27,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 07:52:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:27,537 INFO L225 Difference]: With dead ends: 1229 [2019-11-20 07:52:27,538 INFO L226 Difference]: Without dead ends: 822 [2019-11-20 07:52:27,539 INFO L630 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 [2019-11-20 07:52:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-11-20 07:52:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 421. [2019-11-20 07:52:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 07:52:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2019-11-20 07:52:27,565 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 13 [2019-11-20 07:52:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:27,566 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2019-11-20 07:52:27,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2019-11-20 07:52:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 07:52:27,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:27,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:27,578 INFO L410 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]=== [2019-11-20 07:52:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1826556945, now seen corresponding path program 1 times [2019-11-20 07:52:27,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:27,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546964055] [2019-11-20 07:52:27,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:52:27,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546964055] [2019-11-20 07:52:27,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:27,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:27,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039526057] [2019-11-20 07:52:27,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:27,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:27,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:27,658 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand 3 states. [2019-11-20 07:52:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:27,683 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2019-11-20 07:52:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:27,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 07:52:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:27,686 INFO L225 Difference]: With dead ends: 657 [2019-11-20 07:52:27,687 INFO L226 Difference]: Without dead ends: 421 [2019-11-20 07:52:27,688 INFO L630 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 [2019-11-20 07:52:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-20 07:52:27,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-20 07:52:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 07:52:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 647 transitions. [2019-11-20 07:52:27,701 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 647 transitions. Word has length 17 [2019-11-20 07:52:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:27,701 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 647 transitions. [2019-11-20 07:52:27,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 647 transitions. [2019-11-20 07:52:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:52:27,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:27,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:27,705 INFO L410 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]=== [2019-11-20 07:52:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:27,705 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2019-11-20 07:52:27,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:27,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291227863] [2019-11-20 07:52:27,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:52:27,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291227863] [2019-11-20 07:52:27,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:27,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:27,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322390500] [2019-11-20 07:52:27,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:27,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:27,785 INFO L87 Difference]: Start difference. First operand 421 states and 647 transitions. Second operand 4 states. [2019-11-20 07:52:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:27,862 INFO L93 Difference]: Finished difference Result 1072 states and 1643 transitions. [2019-11-20 07:52:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:52:27,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 07:52:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:27,867 INFO L225 Difference]: With dead ends: 1072 [2019-11-20 07:52:27,868 INFO L226 Difference]: Without dead ends: 663 [2019-11-20 07:52:27,870 INFO L630 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 [2019-11-20 07:52:27,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-20 07:52:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 421. [2019-11-20 07:52:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 07:52:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 646 transitions. [2019-11-20 07:52:27,887 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 646 transitions. Word has length 18 [2019-11-20 07:52:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:27,888 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 646 transitions. [2019-11-20 07:52:27,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 646 transitions. [2019-11-20 07:52:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 07:52:27,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:27,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:27,893 INFO L410 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]=== [2019-11-20 07:52:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2019-11-20 07:52:27,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:27,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668548060] [2019-11-20 07:52:27,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:52:27,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668548060] [2019-11-20 07:52:27,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:27,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:27,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230047836] [2019-11-20 07:52:27,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:27,958 INFO L87 Difference]: Start difference. First operand 421 states and 646 transitions. Second operand 3 states. [2019-11-20 07:52:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,093 INFO L93 Difference]: Finished difference Result 1014 states and 1545 transitions. [2019-11-20 07:52:28,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 07:52:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,097 INFO L225 Difference]: With dead ends: 1014 [2019-11-20 07:52:28,098 INFO L226 Difference]: Without dead ends: 608 [2019-11-20 07:52:28,099 INFO L630 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 [2019-11-20 07:52:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-20 07:52:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 376. [2019-11-20 07:52:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-20 07:52:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 566 transitions. [2019-11-20 07:52:28,149 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 566 transitions. Word has length 21 [2019-11-20 07:52:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,149 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 566 transitions. [2019-11-20 07:52:28,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 566 transitions. [2019-11-20 07:52:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 07:52:28,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,151 INFO L410 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]=== [2019-11-20 07:52:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash -385095713, now seen corresponding path program 1 times [2019-11-20 07:52:28,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849815064] [2019-11-20 07:52:28,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:52:28,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849815064] [2019-11-20 07:52:28,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:28,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811709268] [2019-11-20 07:52:28,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:28,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:28,181 INFO L87 Difference]: Start difference. First operand 376 states and 566 transitions. Second operand 3 states. [2019-11-20 07:52:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,239 INFO L93 Difference]: Finished difference Result 935 states and 1407 transitions. [2019-11-20 07:52:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 07:52:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,243 INFO L225 Difference]: With dead ends: 935 [2019-11-20 07:52:28,244 INFO L226 Difference]: Without dead ends: 574 [2019-11-20 07:52:28,244 INFO L630 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 [2019-11-20 07:52:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-20 07:52:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 350. [2019-11-20 07:52:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-20 07:52:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 520 transitions. [2019-11-20 07:52:28,257 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 520 transitions. Word has length 21 [2019-11-20 07:52:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,257 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 520 transitions. [2019-11-20 07:52:28,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 520 transitions. [2019-11-20 07:52:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 07:52:28,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,260 INFO L410 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]=== [2019-11-20 07:52:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2032684668, now seen corresponding path program 1 times [2019-11-20 07:52:28,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386046367] [2019-11-20 07:52:28,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:52:28,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386046367] [2019-11-20 07:52:28,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:28,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295107917] [2019-11-20 07:52:28,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:28,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:28,323 INFO L87 Difference]: Start difference. First operand 350 states and 520 transitions. Second operand 4 states. [2019-11-20 07:52:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,379 INFO L93 Difference]: Finished difference Result 896 states and 1338 transitions. [2019-11-20 07:52:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:52:28,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-20 07:52:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,383 INFO L225 Difference]: With dead ends: 896 [2019-11-20 07:52:28,383 INFO L226 Difference]: Without dead ends: 572 [2019-11-20 07:52:28,384 INFO L630 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 [2019-11-20 07:52:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-20 07:52:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 350. [2019-11-20 07:52:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-20 07:52:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 519 transitions. [2019-11-20 07:52:28,396 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 519 transitions. Word has length 31 [2019-11-20 07:52:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,396 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 519 transitions. [2019-11-20 07:52:28,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2019-11-20 07:52:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:52:28,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,399 INFO L410 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]=== [2019-11-20 07:52:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -290926641, now seen corresponding path program 1 times [2019-11-20 07:52:28,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460898910] [2019-11-20 07:52:28,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:52:28,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460898910] [2019-11-20 07:52:28,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:28,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270778591] [2019-11-20 07:52:28,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:28,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:28,444 INFO L87 Difference]: Start difference. First operand 350 states and 519 transitions. Second operand 3 states. [2019-11-20 07:52:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,485 INFO L93 Difference]: Finished difference Result 869 states and 1301 transitions. [2019-11-20 07:52:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-20 07:52:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,490 INFO L225 Difference]: With dead ends: 869 [2019-11-20 07:52:28,490 INFO L226 Difference]: Without dead ends: 548 [2019-11-20 07:52:28,491 INFO L630 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 [2019-11-20 07:52:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-20 07:52:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 327. [2019-11-20 07:52:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-11-20 07:52:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 481 transitions. [2019-11-20 07:52:28,502 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 481 transitions. Word has length 34 [2019-11-20 07:52:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,502 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 481 transitions. [2019-11-20 07:52:28,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 481 transitions. [2019-11-20 07:52:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:52:28,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,505 INFO L410 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]=== [2019-11-20 07:52:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1984299198, now seen corresponding path program 1 times [2019-11-20 07:52:28,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638159879] [2019-11-20 07:52:28,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:52:28,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638159879] [2019-11-20 07:52:28,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:28,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663924908] [2019-11-20 07:52:28,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:28,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:28,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:28,543 INFO L87 Difference]: Start difference. First operand 327 states and 481 transitions. Second operand 3 states. [2019-11-20 07:52:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,611 INFO L93 Difference]: Finished difference Result 731 states and 1077 transitions. [2019-11-20 07:52:28,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 07:52:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,618 INFO L225 Difference]: With dead ends: 731 [2019-11-20 07:52:28,618 INFO L226 Difference]: Without dead ends: 433 [2019-11-20 07:52:28,618 INFO L630 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 [2019-11-20 07:52:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-20 07:52:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 295. [2019-11-20 07:52:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 07:52:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 421 transitions. [2019-11-20 07:52:28,630 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 421 transitions. Word has length 35 [2019-11-20 07:52:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,631 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 421 transitions. [2019-11-20 07:52:28,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2019-11-20 07:52:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 07:52:28,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,633 INFO L410 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]=== [2019-11-20 07:52:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1766202321, now seen corresponding path program 1 times [2019-11-20 07:52:28,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000893081] [2019-11-20 07:52:28,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 07:52:28,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000893081] [2019-11-20 07:52:28,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:28,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999992456] [2019-11-20 07:52:28,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:28,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:28,684 INFO L87 Difference]: Start difference. First operand 295 states and 421 transitions. Second operand 4 states. [2019-11-20 07:52:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,733 INFO L93 Difference]: Finished difference Result 752 states and 1089 transitions. [2019-11-20 07:52:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:52:28,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-20 07:52:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,738 INFO L225 Difference]: With dead ends: 752 [2019-11-20 07:52:28,738 INFO L226 Difference]: Without dead ends: 499 [2019-11-20 07:52:28,739 INFO L630 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 [2019-11-20 07:52:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-20 07:52:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 295. [2019-11-20 07:52:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 07:52:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 420 transitions. [2019-11-20 07:52:28,751 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 420 transitions. Word has length 46 [2019-11-20 07:52:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,751 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 420 transitions. [2019-11-20 07:52:28,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 420 transitions. [2019-11-20 07:52:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 07:52:28,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,753 INFO L410 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]=== [2019-11-20 07:52:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash -544708160, now seen corresponding path program 1 times [2019-11-20 07:52:28,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257882094] [2019-11-20 07:52:28,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:52:28,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257882094] [2019-11-20 07:52:28,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:28,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740836874] [2019-11-20 07:52:28,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:28,807 INFO L87 Difference]: Start difference. First operand 295 states and 420 transitions. Second operand 3 states. [2019-11-20 07:52:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,852 INFO L93 Difference]: Finished difference Result 634 states and 937 transitions. [2019-11-20 07:52:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 07:52:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,855 INFO L225 Difference]: With dead ends: 634 [2019-11-20 07:52:28,855 INFO L226 Difference]: Without dead ends: 384 [2019-11-20 07:52:28,856 INFO L630 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 [2019-11-20 07:52:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-20 07:52:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 255. [2019-11-20 07:52:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 07:52:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 370 transitions. [2019-11-20 07:52:28,866 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 370 transitions. Word has length 49 [2019-11-20 07:52:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 370 transitions. [2019-11-20 07:52:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 370 transitions. [2019-11-20 07:52:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 07:52:28,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,868 INFO L410 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]=== [2019-11-20 07:52:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash 390941353, now seen corresponding path program 1 times [2019-11-20 07:52:28,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947406212] [2019-11-20 07:52:28,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:52:28,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947406212] [2019-11-20 07:52:28,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:28,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:28,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773153830] [2019-11-20 07:52:28,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:28,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:28,910 INFO L87 Difference]: Start difference. First operand 255 states and 370 transitions. Second operand 3 states. [2019-11-20 07:52:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:28,937 INFO L93 Difference]: Finished difference Result 435 states and 644 transitions. [2019-11-20 07:52:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:28,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 07:52:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:28,940 INFO L225 Difference]: With dead ends: 435 [2019-11-20 07:52:28,940 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 07:52:28,941 INFO L630 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 [2019-11-20 07:52:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 07:52:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-20 07:52:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-20 07:52:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 324 transitions. [2019-11-20 07:52:28,949 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 324 transitions. Word has length 56 [2019-11-20 07:52:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:28,950 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 324 transitions. [2019-11-20 07:52:28,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 324 transitions. [2019-11-20 07:52:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 07:52:28,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:28,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:28,952 INFO L410 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]=== [2019-11-20 07:52:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1746044383, now seen corresponding path program 1 times [2019-11-20 07:52:28,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:28,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598148958] [2019-11-20 07:52:28,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:52:29,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598148958] [2019-11-20 07:52:29,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:29,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913885848] [2019-11-20 07:52:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:29,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:29,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:29,009 INFO L87 Difference]: Start difference. First operand 225 states and 324 transitions. Second operand 4 states. [2019-11-20 07:52:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,042 INFO L93 Difference]: Finished difference Result 393 states and 578 transitions. [2019-11-20 07:52:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:52:29,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 07:52:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,045 INFO L225 Difference]: With dead ends: 393 [2019-11-20 07:52:29,045 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 07:52:29,048 INFO L630 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 [2019-11-20 07:52:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 07:52:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-20 07:52:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-20 07:52:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 323 transitions. [2019-11-20 07:52:29,056 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 323 transitions. Word has length 59 [2019-11-20 07:52:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 323 transitions. [2019-11-20 07:52:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 323 transitions. [2019-11-20 07:52:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 07:52:29,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,058 INFO L410 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]=== [2019-11-20 07:52:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 621112538, now seen corresponding path program 1 times [2019-11-20 07:52:29,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165228582] [2019-11-20 07:52:29,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165228582] [2019-11-20 07:52:29,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509701657] [2019-11-20 07:52:29,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,109 INFO L87 Difference]: Start difference. First operand 225 states and 323 transitions. Second operand 3 states. [2019-11-20 07:52:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,137 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2019-11-20 07:52:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-20 07:52:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,140 INFO L225 Difference]: With dead ends: 522 [2019-11-20 07:52:29,140 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 07:52:29,142 INFO L630 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 [2019-11-20 07:52:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 07:52:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-20 07:52:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 07:52:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2019-11-20 07:52:29,152 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 62 [2019-11-20 07:52:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,153 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2019-11-20 07:52:29,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2019-11-20 07:52:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 07:52:29,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,154 INFO L410 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]=== [2019-11-20 07:52:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 114301335, now seen corresponding path program 1 times [2019-11-20 07:52:29,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170007357] [2019-11-20 07:52:29,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170007357] [2019-11-20 07:52:29,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549023245] [2019-11-20 07:52:29,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,200 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand 3 states. [2019-11-20 07:52:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,233 INFO L93 Difference]: Finished difference Result 503 states and 747 transitions. [2019-11-20 07:52:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 07:52:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,235 INFO L225 Difference]: With dead ends: 503 [2019-11-20 07:52:29,236 INFO L226 Difference]: Without dead ends: 343 [2019-11-20 07:52:29,236 INFO L630 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 [2019-11-20 07:52:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-20 07:52:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 216. [2019-11-20 07:52:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-20 07:52:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 308 transitions. [2019-11-20 07:52:29,246 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 308 transitions. Word has length 67 [2019-11-20 07:52:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,247 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 308 transitions. [2019-11-20 07:52:29,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 308 transitions. [2019-11-20 07:52:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 07:52:29,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,248 INFO L410 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]=== [2019-11-20 07:52:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2093726931, now seen corresponding path program 1 times [2019-11-20 07:52:29,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840046989] [2019-11-20 07:52:29,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840046989] [2019-11-20 07:52:29,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622803771] [2019-11-20 07:52:29,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,296 INFO L87 Difference]: Start difference. First operand 216 states and 308 transitions. Second operand 3 states. [2019-11-20 07:52:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,318 INFO L93 Difference]: Finished difference Result 370 states and 542 transitions. [2019-11-20 07:52:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 07:52:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,320 INFO L225 Difference]: With dead ends: 370 [2019-11-20 07:52:29,320 INFO L226 Difference]: Without dead ends: 214 [2019-11-20 07:52:29,321 INFO L630 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 [2019-11-20 07:52:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-20 07:52:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-11-20 07:52:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-20 07:52:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2019-11-20 07:52:29,331 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 73 [2019-11-20 07:52:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,331 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2019-11-20 07:52:29,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2019-11-20 07:52:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 07:52:29,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,338 INFO L410 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]=== [2019-11-20 07:52:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash -953900745, now seen corresponding path program 1 times [2019-11-20 07:52:29,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466146462] [2019-11-20 07:52:29,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466146462] [2019-11-20 07:52:29,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126139328] [2019-11-20 07:52:29,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,390 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand 3 states. [2019-11-20 07:52:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,401 INFO L93 Difference]: Finished difference Result 412 states and 601 transitions. [2019-11-20 07:52:29,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-20 07:52:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,403 INFO L225 Difference]: With dead ends: 412 [2019-11-20 07:52:29,403 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 07:52:29,404 INFO L630 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 [2019-11-20 07:52:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 07:52:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 210. [2019-11-20 07:52:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 07:52:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2019-11-20 07:52:29,414 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 80 [2019-11-20 07:52:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,415 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2019-11-20 07:52:29,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2019-11-20 07:52:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:52:29,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,416 INFO L410 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]=== [2019-11-20 07:52:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1940476615, now seen corresponding path program 1 times [2019-11-20 07:52:29,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129341083] [2019-11-20 07:52:29,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129341083] [2019-11-20 07:52:29,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:29,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195787697] [2019-11-20 07:52:29,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:29,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:29,529 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand 4 states. [2019-11-20 07:52:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,631 INFO L93 Difference]: Finished difference Result 534 states and 779 transitions. [2019-11-20 07:52:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:52:29,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 07:52:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,634 INFO L225 Difference]: With dead ends: 534 [2019-11-20 07:52:29,634 INFO L226 Difference]: Without dead ends: 384 [2019-11-20 07:52:29,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:52:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-20 07:52:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 291. [2019-11-20 07:52:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-20 07:52:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 415 transitions. [2019-11-20 07:52:29,651 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 415 transitions. Word has length 83 [2019-11-20 07:52:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,651 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 415 transitions. [2019-11-20 07:52:29,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 415 transitions. [2019-11-20 07:52:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 07:52:29,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,653 INFO L410 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]=== [2019-11-20 07:52:29,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1284591471, now seen corresponding path program 1 times [2019-11-20 07:52:29,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955068428] [2019-11-20 07:52:29,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955068428] [2019-11-20 07:52:29,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860079718] [2019-11-20 07:52:29,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,717 INFO L87 Difference]: Start difference. First operand 291 states and 415 transitions. Second operand 3 states. [2019-11-20 07:52:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,759 INFO L93 Difference]: Finished difference Result 690 states and 1009 transitions. [2019-11-20 07:52:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 07:52:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,763 INFO L225 Difference]: With dead ends: 690 [2019-11-20 07:52:29,763 INFO L226 Difference]: Without dead ends: 497 [2019-11-20 07:52:29,764 INFO L630 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 [2019-11-20 07:52:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-20 07:52:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 361. [2019-11-20 07:52:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 07:52:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 514 transitions. [2019-11-20 07:52:29,788 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 514 transitions. Word has length 99 [2019-11-20 07:52:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,788 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 514 transitions. [2019-11-20 07:52:29,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 514 transitions. [2019-11-20 07:52:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:52:29,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,791 INFO L410 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]=== [2019-11-20 07:52:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1539198065, now seen corresponding path program 1 times [2019-11-20 07:52:29,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173243738] [2019-11-20 07:52:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 07:52:29,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173243738] [2019-11-20 07:52:29,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:29,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:29,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343691156] [2019-11-20 07:52:29,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:29,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:29,864 INFO L87 Difference]: Start difference. First operand 361 states and 514 transitions. Second operand 3 states. [2019-11-20 07:52:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:29,916 INFO L93 Difference]: Finished difference Result 839 states and 1222 transitions. [2019-11-20 07:52:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:29,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 07:52:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:29,920 INFO L225 Difference]: With dead ends: 839 [2019-11-20 07:52:29,920 INFO L226 Difference]: Without dead ends: 603 [2019-11-20 07:52:29,921 INFO L630 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 [2019-11-20 07:52:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-20 07:52:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 455. [2019-11-20 07:52:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-20 07:52:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 648 transitions. [2019-11-20 07:52:29,953 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 648 transitions. Word has length 100 [2019-11-20 07:52:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:29,954 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 648 transitions. [2019-11-20 07:52:29,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 648 transitions. [2019-11-20 07:52:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:52:29,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:29,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:29,956 INFO L410 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]=== [2019-11-20 07:52:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1069877832, now seen corresponding path program 1 times [2019-11-20 07:52:29,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:29,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335966458] [2019-11-20 07:52:29,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:52:30,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335966458] [2019-11-20 07:52:30,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686055554] [2019-11-20 07:52:30,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:52:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:30,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:52:30,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:52:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 07:52:30,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:52:30,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 07:52:30,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186329417] [2019-11-20 07:52:30,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:52:30,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:52:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:52:30,293 INFO L87 Difference]: Start difference. First operand 455 states and 648 transitions. Second operand 6 states. [2019-11-20 07:52:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:30,647 INFO L93 Difference]: Finished difference Result 1190 states and 1646 transitions. [2019-11-20 07:52:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 07:52:30,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-20 07:52:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:30,652 INFO L225 Difference]: With dead ends: 1190 [2019-11-20 07:52:30,652 INFO L226 Difference]: Without dead ends: 746 [2019-11-20 07:52:30,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:52:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-11-20 07:52:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 496. [2019-11-20 07:52:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-20 07:52:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 688 transitions. [2019-11-20 07:52:30,685 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 688 transitions. Word has length 101 [2019-11-20 07:52:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 688 transitions. [2019-11-20 07:52:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:52:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2019-11-20 07:52:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 07:52:30,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:30,687 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:52:30,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:52:30,893 INFO L410 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]=== [2019-11-20 07:52:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash -958769693, now seen corresponding path program 1 times [2019-11-20 07:52:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:30,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781222164] [2019-11-20 07:52:30,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-20 07:52:30,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781222164] [2019-11-20 07:52:30,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703441449] [2019-11-20 07:52:30,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:52:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:31,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:52:31,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:52:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 07:52:31,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:52:31,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-20 07:52:31,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366946043] [2019-11-20 07:52:31,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:52:31,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:31,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:52:31,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:52:31,216 INFO L87 Difference]: Start difference. First operand 496 states and 688 transitions. Second operand 7 states. [2019-11-20 07:52:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:31,535 INFO L93 Difference]: Finished difference Result 1395 states and 1935 transitions. [2019-11-20 07:52:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 07:52:31,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-11-20 07:52:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:31,541 INFO L225 Difference]: With dead ends: 1395 [2019-11-20 07:52:31,541 INFO L226 Difference]: Without dead ends: 918 [2019-11-20 07:52:31,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:52:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-20 07:52:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 537. [2019-11-20 07:52:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-20 07:52:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 736 transitions. [2019-11-20 07:52:31,572 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 736 transitions. Word has length 139 [2019-11-20 07:52:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:31,573 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 736 transitions. [2019-11-20 07:52:31,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:52:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 736 transitions. [2019-11-20 07:52:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 07:52:31,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:31,576 INFO L410 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] [2019-11-20 07:52:31,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:52:31,780 INFO L410 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]=== [2019-11-20 07:52:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash 818430710, now seen corresponding path program 1 times [2019-11-20 07:52:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:31,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283867274] [2019-11-20 07:52:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:31,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283867274] [2019-11-20 07:52:31,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:31,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:31,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815823129] [2019-11-20 07:52:31,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:31,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:31,933 INFO L87 Difference]: Start difference. First operand 537 states and 736 transitions. Second operand 4 states. [2019-11-20 07:52:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:32,021 INFO L93 Difference]: Finished difference Result 851 states and 1186 transitions. [2019-11-20 07:52:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:52:32,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-20 07:52:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:32,026 INFO L225 Difference]: With dead ends: 851 [2019-11-20 07:52:32,027 INFO L226 Difference]: Without dead ends: 849 [2019-11-20 07:52:32,027 INFO L630 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 [2019-11-20 07:52:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-11-20 07:52:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 539. [2019-11-20 07:52:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-11-20 07:52:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 738 transitions. [2019-11-20 07:52:32,066 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 738 transitions. Word has length 177 [2019-11-20 07:52:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:32,067 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 738 transitions. [2019-11-20 07:52:32,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 738 transitions. [2019-11-20 07:52:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 07:52:32,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:32,070 INFO L410 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] [2019-11-20 07:52:32,071 INFO L410 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]=== [2019-11-20 07:52:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1245468310, now seen corresponding path program 1 times [2019-11-20 07:52:32,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:32,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026150517] [2019-11-20 07:52:32,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 07:52:32,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026150517] [2019-11-20 07:52:32,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437508643] [2019-11-20 07:52:32,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:52:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:32,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:52:32,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:52:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 07:52:32,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:52:32,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-20 07:52:32,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778325949] [2019-11-20 07:52:32,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 07:52:32,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 07:52:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 07:52:32,600 INFO L87 Difference]: Start difference. First operand 539 states and 738 transitions. Second operand 11 states. [2019-11-20 07:52:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:33,450 INFO L93 Difference]: Finished difference Result 2992 states and 4233 transitions. [2019-11-20 07:52:33,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 07:52:33,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 180 [2019-11-20 07:52:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:33,465 INFO L225 Difference]: With dead ends: 2992 [2019-11-20 07:52:33,465 INFO L226 Difference]: Without dead ends: 2690 [2019-11-20 07:52:33,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-20 07:52:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-11-20 07:52:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 727. [2019-11-20 07:52:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-11-20 07:52:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 987 transitions. [2019-11-20 07:52:33,525 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 987 transitions. Word has length 180 [2019-11-20 07:52:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:33,526 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 987 transitions. [2019-11-20 07:52:33,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 07:52:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 987 transitions. [2019-11-20 07:52:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 07:52:33,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:33,529 INFO L410 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] [2019-11-20 07:52:33,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:52:33,733 INFO L410 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]=== [2019-11-20 07:52:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash -34395368, now seen corresponding path program 1 times [2019-11-20 07:52:33,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:33,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569706701] [2019-11-20 07:52:33,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:33,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569706701] [2019-11-20 07:52:33,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:33,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:33,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175564594] [2019-11-20 07:52:33,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:33,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:33,834 INFO L87 Difference]: Start difference. First operand 727 states and 987 transitions. Second operand 3 states. [2019-11-20 07:52:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:33,964 INFO L93 Difference]: Finished difference Result 1572 states and 2166 transitions. [2019-11-20 07:52:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:33,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-20 07:52:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:33,971 INFO L225 Difference]: With dead ends: 1572 [2019-11-20 07:52:33,971 INFO L226 Difference]: Without dead ends: 1270 [2019-11-20 07:52:33,972 INFO L630 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 [2019-11-20 07:52:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-20 07:52:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 727. [2019-11-20 07:52:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-11-20 07:52:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 985 transitions. [2019-11-20 07:52:34,022 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 985 transitions. Word has length 180 [2019-11-20 07:52:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:34,023 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 985 transitions. [2019-11-20 07:52:34,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 985 transitions. [2019-11-20 07:52:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 07:52:34,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:34,026 INFO L410 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] [2019-11-20 07:52:34,026 INFO L410 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]=== [2019-11-20 07:52:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1859951354, now seen corresponding path program 1 times [2019-11-20 07:52:34,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:34,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503788927] [2019-11-20 07:52:34,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-20 07:52:34,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503788927] [2019-11-20 07:52:34,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:34,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:52:34,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707290933] [2019-11-20 07:52:34,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:52:34,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:52:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:52:34,092 INFO L87 Difference]: Start difference. First operand 727 states and 985 transitions. Second operand 3 states. [2019-11-20 07:52:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:34,154 INFO L93 Difference]: Finished difference Result 1192 states and 1628 transitions. [2019-11-20 07:52:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:52:34,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-20 07:52:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:34,158 INFO L225 Difference]: With dead ends: 1192 [2019-11-20 07:52:34,158 INFO L226 Difference]: Without dead ends: 586 [2019-11-20 07:52:34,159 INFO L630 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 [2019-11-20 07:52:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-20 07:52:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 585. [2019-11-20 07:52:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-20 07:52:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 769 transitions. [2019-11-20 07:52:34,195 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 769 transitions. Word has length 183 [2019-11-20 07:52:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:34,195 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 769 transitions. [2019-11-20 07:52:34,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:52:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 769 transitions. [2019-11-20 07:52:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 07:52:34,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:34,198 INFO L410 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] [2019-11-20 07:52:34,198 INFO L410 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]=== [2019-11-20 07:52:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2102972572, now seen corresponding path program 1 times [2019-11-20 07:52:34,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:34,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315321797] [2019-11-20 07:52:34,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:34,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315321797] [2019-11-20 07:52:34,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:34,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 07:52:34,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574318278] [2019-11-20 07:52:34,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 07:52:34,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 07:52:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:52:34,442 INFO L87 Difference]: Start difference. First operand 585 states and 769 transitions. Second operand 9 states. [2019-11-20 07:52:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:35,927 INFO L93 Difference]: Finished difference Result 1910 states and 2584 transitions. [2019-11-20 07:52:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 07:52:35,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-11-20 07:52:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:35,937 INFO L225 Difference]: With dead ends: 1910 [2019-11-20 07:52:35,937 INFO L226 Difference]: Without dead ends: 1619 [2019-11-20 07:52:35,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 07:52:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2019-11-20 07:52:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 675. [2019-11-20 07:52:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-11-20 07:52:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 885 transitions. [2019-11-20 07:52:35,989 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 885 transitions. Word has length 188 [2019-11-20 07:52:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:35,989 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 885 transitions. [2019-11-20 07:52:35,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 07:52:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 885 transitions. [2019-11-20 07:52:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 07:52:35,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:35,992 INFO L410 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] [2019-11-20 07:52:35,992 INFO L410 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]=== [2019-11-20 07:52:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash -567802538, now seen corresponding path program 1 times [2019-11-20 07:52:35,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:35,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110942087] [2019-11-20 07:52:35,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:36,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110942087] [2019-11-20 07:52:36,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:36,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 07:52:36,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764138375] [2019-11-20 07:52:36,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:52:36,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:36,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:52:36,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:52:36,114 INFO L87 Difference]: Start difference. First operand 675 states and 885 transitions. Second operand 6 states. [2019-11-20 07:52:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:36,267 INFO L93 Difference]: Finished difference Result 2092 states and 2826 transitions. [2019-11-20 07:52:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:52:36,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-11-20 07:52:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:36,277 INFO L225 Difference]: With dead ends: 2092 [2019-11-20 07:52:36,277 INFO L226 Difference]: Without dead ends: 1705 [2019-11-20 07:52:36,280 INFO L630 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 [2019-11-20 07:52:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2019-11-20 07:52:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 752. [2019-11-20 07:52:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-20 07:52:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 983 transitions. [2019-11-20 07:52:36,338 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 983 transitions. Word has length 194 [2019-11-20 07:52:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:36,339 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 983 transitions. [2019-11-20 07:52:36,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:52:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 983 transitions. [2019-11-20 07:52:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 07:52:36,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:36,341 INFO L410 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] [2019-11-20 07:52:36,342 INFO L410 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]=== [2019-11-20 07:52:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 190520342, now seen corresponding path program 1 times [2019-11-20 07:52:36,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:36,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615798803] [2019-11-20 07:52:36,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:36,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615798803] [2019-11-20 07:52:36,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:36,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:52:36,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692599987] [2019-11-20 07:52:36,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:52:36,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:52:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:52:36,522 INFO L87 Difference]: Start difference. First operand 752 states and 983 transitions. Second operand 7 states. [2019-11-20 07:52:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:36,988 INFO L93 Difference]: Finished difference Result 1783 states and 2362 transitions. [2019-11-20 07:52:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 07:52:36,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-20 07:52:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:36,997 INFO L225 Difference]: With dead ends: 1783 [2019-11-20 07:52:36,997 INFO L226 Difference]: Without dead ends: 1322 [2019-11-20 07:52:36,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:52:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-20 07:52:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 793. [2019-11-20 07:52:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-20 07:52:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1029 transitions. [2019-11-20 07:52:37,077 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1029 transitions. Word has length 194 [2019-11-20 07:52:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:37,078 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1029 transitions. [2019-11-20 07:52:37,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:52:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1029 transitions. [2019-11-20 07:52:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 07:52:37,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:37,081 INFO L410 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] [2019-11-20 07:52:37,082 INFO L410 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]=== [2019-11-20 07:52:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1531612590, now seen corresponding path program 1 times [2019-11-20 07:52:37,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:37,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736375462] [2019-11-20 07:52:37,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:37,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736375462] [2019-11-20 07:52:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:52:37,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760559440] [2019-11-20 07:52:37,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:52:37,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:52:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:52:37,280 INFO L87 Difference]: Start difference. First operand 793 states and 1029 transitions. Second operand 7 states. [2019-11-20 07:52:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:37,759 INFO L93 Difference]: Finished difference Result 1853 states and 2442 transitions. [2019-11-20 07:52:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 07:52:37,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2019-11-20 07:52:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:37,767 INFO L225 Difference]: With dead ends: 1853 [2019-11-20 07:52:37,767 INFO L226 Difference]: Without dead ends: 1346 [2019-11-20 07:52:37,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:52:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-20 07:52:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 812. [2019-11-20 07:52:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-11-20 07:52:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1053 transitions. [2019-11-20 07:52:37,841 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1053 transitions. Word has length 194 [2019-11-20 07:52:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:37,842 INFO L462 AbstractCegarLoop]: Abstraction has 812 states and 1053 transitions. [2019-11-20 07:52:37,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:52:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1053 transitions. [2019-11-20 07:52:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 07:52:37,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:37,845 INFO L410 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] [2019-11-20 07:52:37,846 INFO L410 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]=== [2019-11-20 07:52:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1585508679, now seen corresponding path program 1 times [2019-11-20 07:52:37,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:37,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398786415] [2019-11-20 07:52:37,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-20 07:52:37,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398786415] [2019-11-20 07:52:37,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:52:37,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:52:37,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969663715] [2019-11-20 07:52:37,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:52:37,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:52:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:52:37,960 INFO L87 Difference]: Start difference. First operand 812 states and 1053 transitions. Second operand 4 states. [2019-11-20 07:52:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:52:38,169 INFO L93 Difference]: Finished difference Result 1467 states and 1930 transitions. [2019-11-20 07:52:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:52:38,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-20 07:52:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:52:38,174 INFO L225 Difference]: With dead ends: 1467 [2019-11-20 07:52:38,175 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 07:52:38,177 INFO L630 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 [2019-11-20 07:52:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 07:52:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 642. [2019-11-20 07:52:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-20 07:52:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2019-11-20 07:52:38,233 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 203 [2019-11-20 07:52:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:52:38,233 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2019-11-20 07:52:38,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:52:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2019-11-20 07:52:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 07:52:38,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:52:38,237 INFO L410 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] [2019-11-20 07:52:38,237 INFO L410 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]=== [2019-11-20 07:52:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:52:38,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1545379130, now seen corresponding path program 1 times [2019-11-20 07:52:38,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:52:38,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679251246] [2019-11-20 07:52:38,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:52:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:38,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679251246] [2019-11-20 07:52:38,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485317307] [2019-11-20 07:52:38,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:52:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:52:38,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 07:52:38,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:52:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:52:39,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:52:39,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-20 07:52:39,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604408965] [2019-11-20 07:52:39,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 07:52:39,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:52:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 07:52:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-20 07:52:39,027 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand 19 states. [2019-11-20 07:53:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:16,865 INFO L93 Difference]: Finished difference Result 19537 states and 25738 transitions. [2019-11-20 07:53:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 948 states. [2019-11-20 07:53:16,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-11-20 07:53:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:16,926 INFO L225 Difference]: With dead ends: 19537 [2019-11-20 07:53:16,926 INFO L226 Difference]: Without dead ends: 19145 [2019-11-20 07:53:16,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1183 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 962 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443379 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=62902, Invalid=865430, Unknown=0, NotChecked=0, Total=928332 [2019-11-20 07:53:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2019-11-20 07:53:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 1978. [2019-11-20 07:53:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-20 07:53:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2503 transitions. [2019-11-20 07:53:17,349 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2503 transitions. Word has length 226 [2019-11-20 07:53:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:17,350 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2503 transitions. [2019-11-20 07:53:17,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 07:53:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2503 transitions. [2019-11-20 07:53:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 07:53:17,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:17,357 INFO L410 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] [2019-11-20 07:53:17,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:53:17,562 INFO L410 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]=== [2019-11-20 07:53:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 27498942, now seen corresponding path program 1 times [2019-11-20 07:53:17,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:17,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425960010] [2019-11-20 07:53:17,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 07:53:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425960010] [2019-11-20 07:53:17,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:17,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:53:17,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801443999] [2019-11-20 07:53:17,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:53:17,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:53:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:53:17,669 INFO L87 Difference]: Start difference. First operand 1978 states and 2503 transitions. Second operand 3 states. [2019-11-20 07:53:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:17,916 INFO L93 Difference]: Finished difference Result 3901 states and 4927 transitions. [2019-11-20 07:53:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:53:17,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-20 07:53:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:17,921 INFO L225 Difference]: With dead ends: 3901 [2019-11-20 07:53:17,922 INFO L226 Difference]: Without dead ends: 2203 [2019-11-20 07:53:17,924 INFO L630 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 [2019-11-20 07:53:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-11-20 07:53:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1972. [2019-11-20 07:53:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2019-11-20 07:53:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2407 transitions. [2019-11-20 07:53:18,130 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2407 transitions. Word has length 226 [2019-11-20 07:53:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:18,131 INFO L462 AbstractCegarLoop]: Abstraction has 1972 states and 2407 transitions. [2019-11-20 07:53:18,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:53:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2407 transitions. [2019-11-20 07:53:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 07:53:18,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:18,136 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:18,137 INFO L410 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]=== [2019-11-20 07:53:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1407792312, now seen corresponding path program 1 times [2019-11-20 07:53:18,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:18,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918013428] [2019-11-20 07:53:18,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-20 07:53:18,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918013428] [2019-11-20 07:53:18,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:18,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:53:18,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881406526] [2019-11-20 07:53:18,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:53:18,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:53:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:53:18,240 INFO L87 Difference]: Start difference. First operand 1972 states and 2407 transitions. Second operand 3 states. [2019-11-20 07:53:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:18,612 INFO L93 Difference]: Finished difference Result 5171 states and 6280 transitions. [2019-11-20 07:53:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:53:18,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-20 07:53:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:18,619 INFO L225 Difference]: With dead ends: 5171 [2019-11-20 07:53:18,619 INFO L226 Difference]: Without dead ends: 3559 [2019-11-20 07:53:18,622 INFO L630 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 [2019-11-20 07:53:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-11-20 07:53:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2154. [2019-11-20 07:53:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-11-20 07:53:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2633 transitions. [2019-11-20 07:53:18,849 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2633 transitions. Word has length 226 [2019-11-20 07:53:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:18,849 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 2633 transitions. [2019-11-20 07:53:18,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:53:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2633 transitions. [2019-11-20 07:53:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 07:53:18,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:18,855 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:18,858 INFO L410 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]=== [2019-11-20 07:53:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 440441658, now seen corresponding path program 1 times [2019-11-20 07:53:18,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:18,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284456001] [2019-11-20 07:53:18,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 07:53:19,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284456001] [2019-11-20 07:53:19,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:19,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:53:19,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910412322] [2019-11-20 07:53:19,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:53:19,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:19,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:53:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:53:19,019 INFO L87 Difference]: Start difference. First operand 2154 states and 2633 transitions. Second operand 3 states. [2019-11-20 07:53:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:19,424 INFO L93 Difference]: Finished difference Result 3944 states and 4828 transitions. [2019-11-20 07:53:19,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:53:19,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-20 07:53:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:19,429 INFO L225 Difference]: With dead ends: 3944 [2019-11-20 07:53:19,429 INFO L226 Difference]: Without dead ends: 2049 [2019-11-20 07:53:19,431 INFO L630 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 [2019-11-20 07:53:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-11-20 07:53:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-11-20 07:53:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-20 07:53:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2484 transitions. [2019-11-20 07:53:19,645 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2484 transitions. Word has length 226 [2019-11-20 07:53:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:19,646 INFO L462 AbstractCegarLoop]: Abstraction has 2049 states and 2484 transitions. [2019-11-20 07:53:19,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:53:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2484 transitions. [2019-11-20 07:53:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-20 07:53:19,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:19,652 INFO L410 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] [2019-11-20 07:53:19,652 INFO L410 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]=== [2019-11-20 07:53:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1186673582, now seen corresponding path program 1 times [2019-11-20 07:53:19,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:19,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133280558] [2019-11-20 07:53:19,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 07:53:20,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133280558] [2019-11-20 07:53:20,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386285144] [2019-11-20 07:53:20,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:53:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:20,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 07:53:20,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:53:20,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:53:20,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-20 07:53:20,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541295484] [2019-11-20 07:53:20,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 07:53:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 07:53:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-20 07:53:20,377 INFO L87 Difference]: Start difference. First operand 2049 states and 2484 transitions. Second operand 16 states. [2019-11-20 07:53:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:23,863 INFO L93 Difference]: Finished difference Result 8461 states and 10546 transitions. [2019-11-20 07:53:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-20 07:53:23,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 227 [2019-11-20 07:53:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:23,877 INFO L225 Difference]: With dead ends: 8461 [2019-11-20 07:53:23,877 INFO L226 Difference]: Without dead ends: 6790 [2019-11-20 07:53:23,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4759 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1357, Invalid=12215, Unknown=0, NotChecked=0, Total=13572 [2019-11-20 07:53:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-11-20 07:53:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 2666. [2019-11-20 07:53:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2666 states. [2019-11-20 07:53:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 3219 transitions. [2019-11-20 07:53:24,285 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 3219 transitions. Word has length 227 [2019-11-20 07:53:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:24,286 INFO L462 AbstractCegarLoop]: Abstraction has 2666 states and 3219 transitions. [2019-11-20 07:53:24,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 07:53:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3219 transitions. [2019-11-20 07:53:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 07:53:24,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:24,296 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:24,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:53:24,500 INFO L410 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]=== [2019-11-20 07:53:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash -390808351, now seen corresponding path program 1 times [2019-11-20 07:53:24,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:24,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453470341] [2019-11-20 07:53:24,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-11-20 07:53:24,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453470341] [2019-11-20 07:53:24,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:53:24,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:53:24,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190903132] [2019-11-20 07:53:24,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:53:24,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:53:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:53:24,564 INFO L87 Difference]: Start difference. First operand 2666 states and 3219 transitions. Second operand 3 states. [2019-11-20 07:53:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:24,787 INFO L93 Difference]: Finished difference Result 5026 states and 6057 transitions. [2019-11-20 07:53:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:53:24,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-20 07:53:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:24,792 INFO L225 Difference]: With dead ends: 5026 [2019-11-20 07:53:24,793 INFO L226 Difference]: Without dead ends: 2373 [2019-11-20 07:53:24,795 INFO L630 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 [2019-11-20 07:53:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-11-20 07:53:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2019-11-20 07:53:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2373 states. [2019-11-20 07:53:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 2844 transitions. [2019-11-20 07:53:25,058 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 2844 transitions. Word has length 235 [2019-11-20 07:53:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:25,058 INFO L462 AbstractCegarLoop]: Abstraction has 2373 states and 2844 transitions. [2019-11-20 07:53:25,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:53:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 2844 transitions. [2019-11-20 07:53:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-20 07:53:25,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:25,063 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:25,064 INFO L410 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]=== [2019-11-20 07:53:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1880928432, now seen corresponding path program 1 times [2019-11-20 07:53:25,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:25,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477392202] [2019-11-20 07:53:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:53:25,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477392202] [2019-11-20 07:53:25,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282161117] [2019-11-20 07:53:25,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:53:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:25,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:53:25,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-20 07:53:25,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 07:53:25,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-20 07:53:25,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754178050] [2019-11-20 07:53:25,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:53:25,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:53:25,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:53:25,483 INFO L87 Difference]: Start difference. First operand 2373 states and 2844 transitions. Second operand 5 states. [2019-11-20 07:53:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:25,706 INFO L93 Difference]: Finished difference Result 4434 states and 5339 transitions. [2019-11-20 07:53:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:53:25,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-11-20 07:53:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:25,711 INFO L225 Difference]: With dead ends: 4434 [2019-11-20 07:53:25,711 INFO L226 Difference]: Without dead ends: 2385 [2019-11-20 07:53:25,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:53:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-20 07:53:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2381. [2019-11-20 07:53:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-11-20 07:53:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2848 transitions. [2019-11-20 07:53:25,973 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2848 transitions. Word has length 238 [2019-11-20 07:53:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:25,974 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 2848 transitions. [2019-11-20 07:53:25,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:53:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2848 transitions. [2019-11-20 07:53:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-20 07:53:25,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:25,979 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:26,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:53:26,183 INFO L410 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]=== [2019-11-20 07:53:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash -189886281, now seen corresponding path program 1 times [2019-11-20 07:53:26,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:26,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951850851] [2019-11-20 07:53:26,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:53:26,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951850851] [2019-11-20 07:53:26,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407075050] [2019-11-20 07:53:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:53:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:26,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 07:53:26,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 07:53:27,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:53:27,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2019-11-20 07:53:27,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702149332] [2019-11-20 07:53:27,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 07:53:27,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 07:53:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-11-20 07:53:27,112 INFO L87 Difference]: Start difference. First operand 2381 states and 2848 transitions. Second operand 28 states. [2019-11-20 07:53:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:53:42,890 INFO L93 Difference]: Finished difference Result 17866 states and 22608 transitions. [2019-11-20 07:53:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-11-20 07:53:42,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 239 [2019-11-20 07:53:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:53:42,906 INFO L225 Difference]: With dead ends: 17866 [2019-11-20 07:53:42,906 INFO L226 Difference]: Without dead ends: 15856 [2019-11-20 07:53:42,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28099 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6878, Invalid=62028, Unknown=0, NotChecked=0, Total=68906 [2019-11-20 07:53:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15856 states. [2019-11-20 07:53:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15856 to 2381. [2019-11-20 07:53:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-11-20 07:53:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2845 transitions. [2019-11-20 07:53:43,258 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2845 transitions. Word has length 239 [2019-11-20 07:53:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:53:43,259 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 2845 transitions. [2019-11-20 07:53:43,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 07:53:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2845 transitions. [2019-11-20 07:53:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-20 07:53:43,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:53:43,263 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:53:43,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:53:43,467 INFO L410 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]=== [2019-11-20 07:53:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:53:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1182283854, now seen corresponding path program 1 times [2019-11-20 07:53:43,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:53:43,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206762824] [2019-11-20 07:53:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:53:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:53:44,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206762824] [2019-11-20 07:53:44,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326135342] [2019-11-20 07:53:44,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:53:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:53:44,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 07:53:44,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:53:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-20 07:53:44,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:53:44,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-20 07:53:44,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65973799] [2019-11-20 07:53:44,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 07:53:44,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:53:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 07:53:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-11-20 07:53:44,713 INFO L87 Difference]: Start difference. First operand 2381 states and 2845 transitions. Second operand 30 states. [2019-11-20 07:53:51,760 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 07:54:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:05,661 INFO L93 Difference]: Finished difference Result 32621 states and 40938 transitions. [2019-11-20 07:54:05,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-11-20 07:54:05,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 246 [2019-11-20 07:54:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:05,695 INFO L225 Difference]: With dead ends: 32621 [2019-11-20 07:54:05,695 INFO L226 Difference]: Without dead ends: 30611 [2019-11-20 07:54:05,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27117 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=6772, Invalid=61088, Unknown=0, NotChecked=0, Total=67860 [2019-11-20 07:54:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30611 states. [2019-11-20 07:54:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30611 to 3131. [2019-11-20 07:54:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2019-11-20 07:54:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 3799 transitions. [2019-11-20 07:54:06,396 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 3799 transitions. Word has length 246 [2019-11-20 07:54:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:06,396 INFO L462 AbstractCegarLoop]: Abstraction has 3131 states and 3799 transitions. [2019-11-20 07:54:06,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 07:54:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 3799 transitions. [2019-11-20 07:54:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-20 07:54:06,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:06,402 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:06,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:54:06,607 INFO L410 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]=== [2019-11-20 07:54:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1570186178, now seen corresponding path program 1 times [2019-11-20 07:54:06,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:06,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124268738] [2019-11-20 07:54:06,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 07:54:06,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124268738] [2019-11-20 07:54:06,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:54:06,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:54:06,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107238671] [2019-11-20 07:54:06,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:54:06,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:54:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:54:06,768 INFO L87 Difference]: Start difference. First operand 3131 states and 3799 transitions. Second operand 5 states. [2019-11-20 07:54:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:07,561 INFO L93 Difference]: Finished difference Result 5974 states and 7285 transitions. [2019-11-20 07:54:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:54:07,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-11-20 07:54:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:07,566 INFO L225 Difference]: With dead ends: 5974 [2019-11-20 07:54:07,567 INFO L226 Difference]: Without dead ends: 3185 [2019-11-20 07:54:07,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:54:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2019-11-20 07:54:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3167. [2019-11-20 07:54:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3167 states. [2019-11-20 07:54:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 3823 transitions. [2019-11-20 07:54:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 3823 transitions. Word has length 262 [2019-11-20 07:54:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:08,119 INFO L462 AbstractCegarLoop]: Abstraction has 3167 states and 3823 transitions. [2019-11-20 07:54:08,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:54:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3823 transitions. [2019-11-20 07:54:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 07:54:08,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:08,125 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:08,125 INFO L410 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]=== [2019-11-20 07:54:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1234049955, now seen corresponding path program 1 times [2019-11-20 07:54:08,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:08,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844609338] [2019-11-20 07:54:08,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:08,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844609338] [2019-11-20 07:54:08,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63992031] [2019-11-20 07:54:08,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:54:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:08,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 07:54:08,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:54:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:08,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:54:08,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 07:54:08,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723200681] [2019-11-20 07:54:08,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 07:54:08,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 07:54:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-20 07:54:08,980 INFO L87 Difference]: Start difference. First operand 3167 states and 3823 transitions. Second operand 24 states. [2019-11-20 07:54:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:22,515 INFO L93 Difference]: Finished difference Result 31432 states and 39494 transitions. [2019-11-20 07:54:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-11-20 07:54:22,515 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 263 [2019-11-20 07:54:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:22,535 INFO L225 Difference]: With dead ends: 31432 [2019-11-20 07:54:22,535 INFO L226 Difference]: Without dead ends: 28820 [2019-11-20 07:54:22,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24764 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9015, Invalid=52241, Unknown=0, NotChecked=0, Total=61256 [2019-11-20 07:54:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28820 states. [2019-11-20 07:54:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28820 to 3155. [2019-11-20 07:54:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3155 states. [2019-11-20 07:54:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 3811 transitions. [2019-11-20 07:54:23,278 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 3811 transitions. Word has length 263 [2019-11-20 07:54:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:23,278 INFO L462 AbstractCegarLoop]: Abstraction has 3155 states and 3811 transitions. [2019-11-20 07:54:23,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 07:54:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 3811 transitions. [2019-11-20 07:54:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 07:54:23,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:23,283 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:23,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:54:23,487 INFO L410 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]=== [2019-11-20 07:54:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 649278305, now seen corresponding path program 1 times [2019-11-20 07:54:23,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:23,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933509083] [2019-11-20 07:54:23,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-20 07:54:23,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933509083] [2019-11-20 07:54:23,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:54:23,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:54:23,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457083439] [2019-11-20 07:54:23,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:54:23,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:54:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:54:23,596 INFO L87 Difference]: Start difference. First operand 3155 states and 3811 transitions. Second operand 3 states. [2019-11-20 07:54:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:23,929 INFO L93 Difference]: Finished difference Result 4439 states and 5375 transitions. [2019-11-20 07:54:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:54:23,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 07:54:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:23,930 INFO L225 Difference]: With dead ends: 4439 [2019-11-20 07:54:23,931 INFO L226 Difference]: Without dead ends: 1684 [2019-11-20 07:54:23,933 INFO L630 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 [2019-11-20 07:54:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-20 07:54:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2019-11-20 07:54:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-11-20 07:54:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2002 transitions. [2019-11-20 07:54:24,259 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2002 transitions. Word has length 263 [2019-11-20 07:54:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:24,259 INFO L462 AbstractCegarLoop]: Abstraction has 1684 states and 2002 transitions. [2019-11-20 07:54:24,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:54:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2002 transitions. [2019-11-20 07:54:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 07:54:24,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:24,262 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:24,262 INFO L410 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]=== [2019-11-20 07:54:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -3824227, now seen corresponding path program 1 times [2019-11-20 07:54:24,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:24,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877157783] [2019-11-20 07:54:24,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:24,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877157783] [2019-11-20 07:54:24,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717181986] [2019-11-20 07:54:24,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:54:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:24,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 07:54:24,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:54:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:25,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:54:25,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-11-20 07:54:25,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475384310] [2019-11-20 07:54:25,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 07:54:25,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 07:54:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 07:54:25,181 INFO L87 Difference]: Start difference. First operand 1684 states and 2002 transitions. Second operand 26 states. [2019-11-20 07:54:30,949 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 07:54:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:35,790 INFO L93 Difference]: Finished difference Result 16391 states and 20392 transitions. [2019-11-20 07:54:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-11-20 07:54:35,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 263 [2019-11-20 07:54:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:35,800 INFO L225 Difference]: With dead ends: 16391 [2019-11-20 07:54:35,800 INFO L226 Difference]: Without dead ends: 15110 [2019-11-20 07:54:35,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18423 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7725, Invalid=40017, Unknown=0, NotChecked=0, Total=47742 [2019-11-20 07:54:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15110 states. [2019-11-20 07:54:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15110 to 2875. [2019-11-20 07:54:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-11-20 07:54:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 3482 transitions. [2019-11-20 07:54:36,300 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 3482 transitions. Word has length 263 [2019-11-20 07:54:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:36,300 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 3482 transitions. [2019-11-20 07:54:36,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 07:54:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3482 transitions. [2019-11-20 07:54:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 07:54:36,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:36,304 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:36,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:54:36,504 INFO L410 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]=== [2019-11-20 07:54:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1123777309, now seen corresponding path program 1 times [2019-11-20 07:54:36,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:36,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023960919] [2019-11-20 07:54:36,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:36,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023960919] [2019-11-20 07:54:36,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9351173] [2019-11-20 07:54:36,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:54:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:37,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 07:54:37,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:54:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:37,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:54:37,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-20 07:54:37,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349555629] [2019-11-20 07:54:37,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 07:54:37,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 07:54:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:54:37,159 INFO L87 Difference]: Start difference. First operand 2875 states and 3482 transitions. Second operand 9 states. [2019-11-20 07:54:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:40,519 INFO L93 Difference]: Finished difference Result 15397 states and 19114 transitions. [2019-11-20 07:54:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 07:54:40,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2019-11-20 07:54:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:40,528 INFO L225 Difference]: With dead ends: 15397 [2019-11-20 07:54:40,528 INFO L226 Difference]: Without dead ends: 13070 [2019-11-20 07:54:40,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 07:54:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13070 states. [2019-11-20 07:54:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13070 to 3673. [2019-11-20 07:54:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-11-20 07:54:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4405 transitions. [2019-11-20 07:54:41,155 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4405 transitions. Word has length 263 [2019-11-20 07:54:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:41,155 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4405 transitions. [2019-11-20 07:54:41,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 07:54:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4405 transitions. [2019-11-20 07:54:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-20 07:54:41,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:41,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:41,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:54:41,366 INFO L410 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]=== [2019-11-20 07:54:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:41,366 INFO L82 PathProgramCache]: Analyzing trace with hash -678366836, now seen corresponding path program 1 times [2019-11-20 07:54:41,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:41,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027548808] [2019-11-20 07:54:41,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 07:54:41,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027548808] [2019-11-20 07:54:41,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:54:41,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:54:41,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389320922] [2019-11-20 07:54:41,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:54:41,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:54:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:54:41,499 INFO L87 Difference]: Start difference. First operand 3673 states and 4405 transitions. Second operand 7 states. [2019-11-20 07:54:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:54:43,295 INFO L93 Difference]: Finished difference Result 9472 states and 11708 transitions. [2019-11-20 07:54:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:54:43,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2019-11-20 07:54:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:54:43,301 INFO L225 Difference]: With dead ends: 9472 [2019-11-20 07:54:43,301 INFO L226 Difference]: Without dead ends: 6393 [2019-11-20 07:54:43,304 INFO L630 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 [2019-11-20 07:54:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6393 states. [2019-11-20 07:54:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6393 to 3901. [2019-11-20 07:54:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-11-20 07:54:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 4693 transitions. [2019-11-20 07:54:43,930 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 4693 transitions. Word has length 264 [2019-11-20 07:54:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:54:43,931 INFO L462 AbstractCegarLoop]: Abstraction has 3901 states and 4693 transitions. [2019-11-20 07:54:43,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:54:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 4693 transitions. [2019-11-20 07:54:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-20 07:54:43,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:54:43,936 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:54:43,936 INFO L410 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]=== [2019-11-20 07:54:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:54:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1412931105, now seen corresponding path program 1 times [2019-11-20 07:54:43,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:54:43,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618971905] [2019-11-20 07:54:43,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:54:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618971905] [2019-11-20 07:54:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460933173] [2019-11-20 07:54:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/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 [2019-11-20 07:54:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:54:44,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 07:54:44,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:54:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 07:54:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:54:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-11-20 07:54:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966607099] [2019-11-20 07:54:44,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 07:54:44,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:54:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 07:54:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 07:54:44,980 INFO L87 Difference]: Start difference. First operand 3901 states and 4693 transitions. Second operand 26 states. [2019-11-20 07:55:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:55:00,581 INFO L93 Difference]: Finished difference Result 33949 states and 42330 transitions. [2019-11-20 07:55:00,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-11-20 07:55:00,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 264 [2019-11-20 07:55:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:55:00,608 INFO L225 Difference]: With dead ends: 33949 [2019-11-20 07:55:00,608 INFO L226 Difference]: Without dead ends: 30642 [2019-11-20 07:55:00,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18257 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7715, Invalid=40027, Unknown=0, NotChecked=0, Total=47742 [2019-11-20 07:55:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30642 states. [2019-11-20 07:55:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30642 to 3887. [2019-11-20 07:55:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3887 states. [2019-11-20 07:55:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 4679 transitions. [2019-11-20 07:55:01,412 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 4679 transitions. Word has length 264 [2019-11-20 07:55:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:55:01,413 INFO L462 AbstractCegarLoop]: Abstraction has 3887 states and 4679 transitions. [2019-11-20 07:55:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 07:55:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 4679 transitions. [2019-11-20 07:55:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-20 07:55:01,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:55:01,417 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:55:01,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:55:01,619 INFO L410 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]=== [2019-11-20 07:55:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:55:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2020202589, now seen corresponding path program 1 times [2019-11-20 07:55:01,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:55:01,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412873726] [2019-11-20 07:55:01,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:55:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:55:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 07:55:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412873726] [2019-11-20 07:55:01,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:55:01,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:55:01,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256404583] [2019-11-20 07:55:01,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:55:01,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:55:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:55:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:55:01,739 INFO L87 Difference]: Start difference. First operand 3887 states and 4679 transitions. Second operand 3 states. [2019-11-20 07:55:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:55:02,328 INFO L93 Difference]: Finished difference Result 6303 states and 7624 transitions. [2019-11-20 07:55:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:55:02,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-11-20 07:55:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:55:02,330 INFO L225 Difference]: With dead ends: 6303 [2019-11-20 07:55:02,330 INFO L226 Difference]: Without dead ends: 2807 [2019-11-20 07:55:02,333 INFO L630 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 [2019-11-20 07:55:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2019-11-20 07:55:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2807. [2019-11-20 07:55:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2807 states. [2019-11-20 07:55:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3363 transitions. [2019-11-20 07:55:02,860 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3363 transitions. Word has length 264 [2019-11-20 07:55:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:55:02,860 INFO L462 AbstractCegarLoop]: Abstraction has 2807 states and 3363 transitions. [2019-11-20 07:55:02,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:55:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3363 transitions. [2019-11-20 07:55:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-20 07:55:02,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:55:02,865 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:55:02,865 INFO L410 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]=== [2019-11-20 07:55:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:55:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1552575887, now seen corresponding path program 1 times [2019-11-20 07:55:02,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:55:02,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519847007] [2019-11-20 07:55:02,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:55:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:55:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 07:55:03,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519847007] [2019-11-20 07:55:03,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:55:03,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:55:03,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523530988] [2019-11-20 07:55:03,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:55:03,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:55:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:55:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:55:03,015 INFO L87 Difference]: Start difference. First operand 2807 states and 3363 transitions. Second operand 7 states. [2019-11-20 07:55:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:55:04,211 INFO L93 Difference]: Finished difference Result 6362 states and 7769 transitions. [2019-11-20 07:55:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:55:04,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 266 [2019-11-20 07:55:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:55:04,214 INFO L225 Difference]: With dead ends: 6362 [2019-11-20 07:55:04,214 INFO L226 Difference]: Without dead ends: 4069 [2019-11-20 07:55:04,216 INFO L630 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 [2019-11-20 07:55:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-11-20 07:55:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 2787. [2019-11-20 07:55:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2787 states. [2019-11-20 07:55:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3333 transitions. [2019-11-20 07:55:04,725 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3333 transitions. Word has length 266 [2019-11-20 07:55:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:55:04,725 INFO L462 AbstractCegarLoop]: Abstraction has 2787 states and 3333 transitions. [2019-11-20 07:55:04,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:55:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3333 transitions. [2019-11-20 07:55:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-20 07:55:04,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:55:04,731 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:55:04,731 INFO L410 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]=== [2019-11-20 07:55:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:55:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash -972033510, now seen corresponding path program 1 times [2019-11-20 07:55:04,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:55:04,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43265062] [2019-11-20 07:55:04,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:55:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:55:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:55:04,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:55:04,951 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:55:05,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:55:05 BoogieIcfgContainer [2019-11-20 07:55:05,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:55:05,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:55:05,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:55:05,182 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:55:05,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:52:26" (3/4) ... [2019-11-20 07:55:05,184 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:55:05,415 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f8b8e1c3-cf32-4990-95e1-0a52f984d628/bin/uautomizer/witness.graphml [2019-11-20 07:55:05,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:55:05,416 INFO L168 Benchmark]: Toolchain (without parser) took 161344.25 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 950.1 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,417 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:55:05,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,418 INFO L168 Benchmark]: Boogie Preprocessor took 132.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:55:05,418 INFO L168 Benchmark]: RCFGBuilder took 1650.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 153.6 MB). Peak memory consumption was 153.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,419 INFO L168 Benchmark]: TraceAbstraction took 158760.65 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 947.1 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,419 INFO L168 Benchmark]: Witness Printer took 234.00 ms. Allocated memory is still 4.9 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:55:05,421 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 475.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1650.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 153.6 MB). Peak memory consumption was 153.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158760.65 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 947.1 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 234.00 ms. Allocated memory is still 4.9 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 580]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L68] msg_t nomsg = (msg_t )-1; [L69] port_t g1v ; [L70] int8_t g1v_old ; [L71] int8_t g1v_new ; [L72] port_t g2v ; [L73] int8_t g2v_old ; [L74] int8_t g2v_new ; [L75] port_t g3v ; [L76] int8_t g3v_old ; [L77] int8_t g3v_new ; [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [L88] _Bool gate1Failed_History_0 ; [L89] _Bool gate1Failed_History_1 ; [L90] _Bool gate1Failed_History_2 ; [L91] _Bool gate2Failed_History_0 ; [L92] _Bool gate2Failed_History_1 ; [L93] _Bool gate2Failed_History_2 ; [L94] _Bool gate3Failed_History_0 ; [L95] _Bool gate3Failed_History_1 ; [L96] _Bool gate3Failed_History_2 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L519] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [g1v=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] [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] gate1Failed = __VERIFIER_nondet_bool() [L528] gate2Failed = __VERIFIER_nondet_bool() [L529] gate3Failed = __VERIFIER_nondet_bool() [L530] VALUE1 = __VERIFIER_nondet_char() [L531] VALUE2 = __VERIFIER_nondet_char() [L532] VALUE3 = __VERIFIER_nondet_char() [L533] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L534] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L535] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L536] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L537] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L538] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L539] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L540] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L541] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L542] votedValue_History_0 = __VERIFIER_nondet_char() [L543] votedValue_History_1 = __VERIFIER_nondet_char() [L544] votedValue_History_2 = __VERIFIER_nondet_char() [L248] int tmp ; [L249] int tmp___0 ; [L250] int tmp___1 ; [L251] int tmp___2 ; [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] tmp = add_history_type(0) [L255] COND FALSE !(! tmp) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] tmp___0 = add_history_type(1) [L259] COND FALSE !(! tmp___0) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] tmp___1 = add_history_type(2) [L263] COND FALSE !(! tmp___1) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] tmp___2 = add_history_type(3) [L267] COND FALSE !(! tmp___2) [L270] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L545] i2 = init() [L547] g1v_old = nomsg [L548] g1v_new = nomsg [L549] g2v_old = nomsg [L550] g2v_new = nomsg [L551] g3v_old = nomsg [L552] g3v_new = nomsg [L553] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] COND TRUE 1 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L458] COND TRUE (int )next_state == 0 [L459] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L294] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L297] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L300] COND TRUE ! gate3Failed [L301] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L171] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L172] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L181] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L182] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L191] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L192] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND TRUE (int )VALUE2 == (int )tmp___1 [L319] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND TRUE (int )VALUE3 == (int )tmp___2 [L323] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L325] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L339] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L155] COND TRUE historyIndex == 1 [L156] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L365] tmp___11 = read_history_int8(3, 0) [L366] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L378] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L566] c1 = check() [L578] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L554] COND TRUE 1 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L396] COND TRUE (int )next_state == 0 [L397] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L408] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L408] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L452] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L155] COND TRUE historyIndex == 1 [L156] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND TRUE (int )tmp___10 > -2 [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] tmp___6 = read_history_int8(3, 0) [L348] COND TRUE (int )tmp___6 == (int )nomsg [L171] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] tmp___7 = read_history_bool(0, 1) [L350] COND TRUE \read(tmp___7) [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L182] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] tmp___8 = read_history_bool(1, 1) [L352] COND TRUE \read(tmp___8) [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L192] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] tmp___9 = read_history_bool(2, 1) [L354] COND TRUE ! tmp___9 [L355] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] c1 = check() [L578] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L580] __VERIFIER_error() VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 514 locations, 37 error locations. Result: UNSAFE, OverallTime: 158.6s, OverallIterations: 51, TraceHistogramMax: 3, AutomataDifference: 133.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 30394 SDtfs, 53152 SDslu, 168055 SDs, 0 SdLazy, 53751 SolverSat, 1581 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5186 GetRequests, 2681 SyntacticMatches, 3 SemanticMatches, 2502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565971 ImplicationChecksByTransitivity, 66.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3901occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 50 MinimizatonAttempts, 151656 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 10296 NumberOfCodeBlocks, 10296 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 9964 ConstructedInterpolants, 0 QuantifiedInterpolants, 7369463 SizeOfPredicates, 81 NumberOfNonLiveVariables, 11006 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 62 InterpolantComputations, 39 PerfectInterpolantSequences, 5198/5759 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...